Matchings in random spanning subgraphs of cubelike graphs

Alexandr V. Kostochka

doi:10.1002/rsa.3240010304

Matchings in random spanning subgraphs of cubelike graphs

Research output: Contribution to journal › Article › peer-review

Abstract

A question about the evolution of random spanning subgraphs G_p of bipartite regular so called cubelike graphs G is considered. It is shown that for G_p of any large enough cubelike graph G the threshold to have a 1‐factor is the same as the threshold to have no isolated vertices. This generalizes a conjecture of K. Weber.

Original language	English (US)
Pages (from-to)	277-285
Number of pages	9
Journal	Random Structures & Algorithms
Volume	1
Issue number	3
DOIs	https://doi.org/10.1002/rsa.3240010304
State	Published - Jan 1 1990
Externally published	Yes

ASJC Scopus subject areas

Software
Mathematics(all)
Computer Graphics and Computer-Aided Design
Applied Mathematics

Access to Document

10.1002/rsa.3240010304

Cite this

@article{e1a36ff0378b497a893821ef7bd0d93e,

title = "Matchings in random spanning subgraphs of cubelike graphs",

abstract = "A question about the evolution of random spanning subgraphs Gp of bipartite regular so called cubelike graphs G is considered. It is shown that for Gp of any large enough cubelike graph G the threshold to have a 1‐factor is the same as the threshold to have no isolated vertices. This generalizes a conjecture of K. Weber.",

author = "Kostochka, {Alexandr V.}",

year = "1990",

month = jan,

day = "1",

doi = "10.1002/rsa.3240010304",

language = "English (US)",

volume = "1",

pages = "277--285",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley & Sons, Ltd.",

number = "3",

}

TY - JOUR

T1 - Matchings in random spanning subgraphs of cubelike graphs

AU - Kostochka, Alexandr V.

PY - 1990/1/1

Y1 - 1990/1/1

N2 - A question about the evolution of random spanning subgraphs Gp of bipartite regular so called cubelike graphs G is considered. It is shown that for Gp of any large enough cubelike graph G the threshold to have a 1‐factor is the same as the threshold to have no isolated vertices. This generalizes a conjecture of K. Weber.

AB - A question about the evolution of random spanning subgraphs Gp of bipartite regular so called cubelike graphs G is considered. It is shown that for Gp of any large enough cubelike graph G the threshold to have a 1‐factor is the same as the threshold to have no isolated vertices. This generalizes a conjecture of K. Weber.

UR - http://www.scopus.com/inward/record.url?scp=84990717213&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990717213&partnerID=8YFLogxK

U2 - 10.1002/rsa.3240010304

DO - 10.1002/rsa.3240010304

M3 - Article

AN - SCOPUS:84990717213

VL - 1

SP - 277

EP - 285

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 3

ER -

Matchings in random spanning subgraphs of cubelike graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other links

Fingerprint

Cite this