The Kőnig graph process

Nina Kamčev; Michael Krivelevich; Natasha Morrison; Benny Sudakov

doi:10.1002/rsa.20969

The Kőnig graph process

Nina Kamčev, Michael Krivelevich^*, Natasha Morrison, Benny Sudakov

^*Corresponding author for this work

School of Mathematical Sciences

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

Abstract

Say that a graph G has property (Formula presented.) if the size of its maximum matching is equal to the order of a minimal vertex cover. We study the following process. Set (Formula presented.) and let e₁, e₂, … e_N be a uniformly random ordering of the edges of K_n, with n an even integer. Let G0 be the empty graph on n vertices. For m ≥ 0, Gm + 1 is obtained from Gm by adding the edge e_{m + 1} exactly if Gm ∪ {e_{m + 1}} has property (Formula presented.). We analyze the behavior of this process, focusing mainly on two questions: What can be said about the structure of GN and for which m will Gm contain a perfect matching?.

Original language	English
Pages (from-to)	1272-1302
Number of pages	31
Journal	Random Structures and Algorithms
Volume	57
Issue number	4
DOIs	https://doi.org/10.1002/rsa.20969
State	Published - 1 Dec 2020

Keywords

matching
perfect matching
random graph
random process
vertex cover

Access to Document

10.1002/rsa.20969

Cite this

@article{9001dd0de04a4be1a5ee37b19951d554,

title = "The K{\H o}nig graph process",

abstract = "Say that a graph G has property (Formula presented.) if the size of its maximum matching is equal to the order of a minimal vertex cover. We study the following process. Set (Formula presented.) and let e1, e2, … eN be a uniformly random ordering of the edges of Kn, with n an even integer. Let G0 be the empty graph on n vertices. For m ≥ 0, Gm + 1 is obtained from Gm by adding the edge em + 1 exactly if Gm ∪ {em + 1} has property (Formula presented.). We analyze the behavior of this process, focusing mainly on two questions: What can be said about the structure of GN and for which m will Gm contain a perfect matching?.",

keywords = "matching, perfect matching, random graph, random process, vertex cover",

author = "Nina Kam{\v c}ev and Michael Krivelevich and Natasha Morrison and Benny Sudakov",

note = "Publisher Copyright: {\textcopyright} 2020 Wiley Periodicals LLC",

year = "2020",

month = dec,

day = "1",

doi = "10.1002/rsa.20969",

language = "אנגלית",

volume = "57",

pages = "1272--1302",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "4",

}

TY - JOUR

T1 - The Kőnig graph process

AU - Kamčev, Nina

AU - Krivelevich, Michael

AU - Morrison, Natasha

AU - Sudakov, Benny

PY - 2020/12/1

Y1 - 2020/12/1

N2 - Say that a graph G has property (Formula presented.) if the size of its maximum matching is equal to the order of a minimal vertex cover. We study the following process. Set (Formula presented.) and let e1, e2, … eN be a uniformly random ordering of the edges of Kn, with n an even integer. Let G0 be the empty graph on n vertices. For m ≥ 0, Gm + 1 is obtained from Gm by adding the edge em + 1 exactly if Gm ∪ {em + 1} has property (Formula presented.). We analyze the behavior of this process, focusing mainly on two questions: What can be said about the structure of GN and for which m will Gm contain a perfect matching?.

AB - Say that a graph G has property (Formula presented.) if the size of its maximum matching is equal to the order of a minimal vertex cover. We study the following process. Set (Formula presented.) and let e1, e2, … eN be a uniformly random ordering of the edges of Kn, with n an even integer. Let G0 be the empty graph on n vertices. For m ≥ 0, Gm + 1 is obtained from Gm by adding the edge em + 1 exactly if Gm ∪ {em + 1} has property (Formula presented.). We analyze the behavior of this process, focusing mainly on two questions: What can be said about the structure of GN and for which m will Gm contain a perfect matching?.

KW - matching

KW - perfect matching

KW - random graph

KW - random process

KW - vertex cover

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

U2 - 10.1002/rsa.20969

DO - 10.1002/rsa.20969

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85092342892

SN - 1042-9832

VL - 57

SP - 1272

EP - 1302

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 4

ER -

The Kőnig graph process

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this