Number of the records: 1
A Median-Type Condition for Graph Tiling
- 1.0477018 - ÚI 2018 RIV NL eng J - Journal Article
Piguet, Diana - Saumell, Maria
A Median-Type Condition for Graph Tiling.
Electronic Notes in Discrete Mathematics. Roč. 61, August (2017), s. 979-985. ISSN 1571-0653
R&D Projects: GA ČR GJ16-07822Y
Grant - others:GA MŠk(CZ) LO1506
Institutional support: RVO:67985807
Keywords : extremal graph theory * graph tiling * regularity lemma * LP-duality
OECD category: Pure mathematics
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.
Permanent Link: http://hdl.handle.net/11104/0273423
Number of the records: 1