Number of the records: 1

A Median-Type Condition for Graph Tiling

SYSNO ASEP	0477018
Document Type	J - Journal Article
R&D Document Type	Journal Article
Subsidiary J	Článek ve SCOPUS
Title	A Median-Type Condition for Graph Tiling
Author(s)	Piguet, Diana (UIVT-O)_{RID, ORCID, SAI} Saumell, Maria (UIVT-O)_{RID, SAI, ORCID}
Source Title	Electronic Notes in Discrete Mathematics. - : Elsevier - ISSN 1571-0653 Roč. 61, August (2017), s. 979-985
Number of pages	7 s.
Language	eng - English
Country	NL - Netherlands
Keywords	extremal graph theory ; graph tiling ; regularity lemma ; LP-duality
Subject RIV	BA - General Mathematics
OECD category	Pure mathematics
R&D Projects	GJ16-07822Y GA ČR - Czech Science Foundation (CSF)
Institutional support	UIVT-O - RVO:67985807
EID SCOPUS	85026742513
DOI	10.1016/j.endm.2017.07.062
Annotation	Komlós [Komlós: Tiling Turán Theorems, Combinatorica, 2000] determined the asymptotically optimal minimum degree condition for covering a given proportion of vertices of a host graph by vertex-disjoint copies of a fixed graph H. We show that the minimum degree condition can be relaxed in the sense that we require only a given fraction of vertices to have the prescribed degree.
Workplace	Institute of Computer Science
Contact	Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
Year of Publishing	2018

Number of the records: 1