Number of the records: 1

Matching polytons

SYSNO ASEP	0512063
Document Type	J - Journal Article
R&D Document Type	Journal Article
Subsidiary J	Článek ve WOS
Title	Matching polytons
Author(s)	Doležal, Martin (MU-W)_{RID, SAI, ORCID} Hladký, Jan (MU-W)_{RID, SAI, ORCID}
Article number	P4.38
Source Title	Electronic Journal of Combinatorics. - : Electrochemical Society - ISSN 1077-8926 Roč. 26, č. 4 (2019)
Number of pages	33 s.
Language	eng - English
Country	US - United States
Keywords	graphon ; matching polytope
Subject RIV	BA - General Mathematics
OECD category	Pure mathematics
R&D Projects	GA16-07378S GA ČR - Czech Science Foundation (CSF)
Method of publishing	Open access
Institutional support	MU-W - RVO:67985840
UT WOS	000506405400007
EID SCOPUS	85075528294
Annotation	Hladký, Hu, and Piguet [Tilings in graphons, preprint] introduced the notions of matching and fractional vertex covers in graphons. These are counterparts to the corresponding notions in finite graphs. Combinatorial optimization studies the structure of the matching polytope and the fractional vertex cover polytope of a graph. Here, in analogy, we initiate the study of the structure of the set of all matchings and of all fractional vertex covers in a graphon. We call these sets the matching polyton and the fractional vertex cover polyton. We also study properties of matching polytons and fractional vertex cover polytons along convergent sequences of graphons.As an auxiliary tool of independent interest, we prove that a graphon is r -partite if and only if it contains no graph of chromatic number r+1. This in turn gives a characterization of bipartite graphons as those having a symmetric spectrum.
Workplace	Mathematical Institute
Contact	Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
Year of Publishing	2020
Electronic address	https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i4p38

Number of the records: 1