论文信息 - A Median-Type Condition for Graph Tiling

A Median-Type Condition for Graph Tiling

Komlos [Tiling Turan theorems, Combinatorica, 20,2 (2000), 203{218] 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. 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.

Diana Piguet | Maria Saumell

[1] Reinhard Diestel,et al. Graph Theory , 1997 .

[2] Jan Hladký,et al. The extremal function for partial bipartite tilings , 2009, Eur. J. Comb..

[3] János Komlós,et al. Tiling Turán Theorems , 2000, Comb..

[4] P. Lax. Proof of a conjecture of P. Erdös on the derivative of a polynomial , 1944 .

[5] E. Szemerédi. Regular Partitions of Graphs , 1975 .

[6] Jan Hladký,et al. Komlós's tiling theorem via graphon covers , 2016, J. Graph Theory.

[7] Diana Piguet,et al. Tilings in graphons , 2016, Eur. J. Comb..

[8] P. Erdös,et al. On the structure of linear graphs , 1946 .

[9] Daniela Kühn,et al. The minimum degree threshold for perfect graph packings , 2009, Comb..

[10] Ryan R. Martin,et al. Asymptotic multipartite version of the Alon-Yuster theorem , 2013, J. Comb. Theory, Ser. B.

[11] P. Erdös. On an extremal problem in graph theory , 1970 .

[12] Andrew Treglown,et al. A degree sequence Hajnal-Szemerédi theorem , 2014, J. Comb. Theory, Ser. B.

[13] Jan Hladký,et al. A density Corrádi-Hajnal theorem , 2011, Electron. Notes Discret. Math..

[14] M. Simonovits,et al. Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .

[15] Peter Allen,et al. A Density Corrádi–Hajnal Theorem , 2011, Canadian Journal of Mathematics.

[16] P. Erdos,et al. On maximal paths and circuits of graphs , 1959 .

[17] Martin Dolezal,et al. Matching Polytons , 2019, Electron. J. Comb..