Near-perfect clique-factors in sparse pseudorandom graphs
暂无分享,去创建一个
[1] Noga Alon,et al. Explicit Ramsey graphs and orthonormal labelings , 1994, Electron. J. Comb..
[2] János Komlós,et al. Blow-up Lemma , 1997, Combinatorics, Probability and Computing.
[3] Bernd Gärtner,et al. Understanding and using linear programming , 2007, Universitext.
[4] Zoltán Füredi,et al. Matchings and covers in hypergraphs , 1988, Graphs Comb..
[5] Noga Alon,et al. Approximating the independence number via theϑ-function , 1998, Math. Program..
[6] Noga Alon,et al. Explicit construction of linear sized tolerant networks , 1988, Discret. Math..
[7] B. Sudakov,et al. Pseudo-random Graphs , 2005, math/0503745.
[8] Yufei Zhao,et al. Extremal results in sparse pseudorandom graphs , 2012, ArXiv.
[9] Benny Sudakov,et al. A generalization of Turán's theorem , 2005, J. Graph Theory.
[10] Vojtech Rödl,et al. Partial Steiner systems and matchings in hypergraphs , 1998, Random Struct. Algorithms.
[11] Y. Kohayakawa,et al. Blow-up lemmas for sparse graphs , 2016, 1612.00622.
[12] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[13] Yoshiharu Kohayakawa,et al. Powers of Hamilton Cycles in Pseudorandom Graphs , 2014, LATIN.
[14] Benny Sudakov,et al. Triangle Factors In Sparse Pseudo-Random Graphs , 2004, Comb..
[15] Robin Wilson,et al. Modern Graph Theory , 2013 .
[16] Vojtech Rödl,et al. Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels , 2011, J. Comb. Theory, Ser. A.
[17] Yoshiharu Kohayakawa,et al. Clique-factors in sparse pseudorandom graphs , 2018, Eur. J. Comb..
[18] Béla Bollobás,et al. Random Graphs , 1985 .
[19] Michael Krivelevich. Perfect fractional matchings in random hypergraphs , 1996, Random Struct. Algorithms.
[20] R. Nenadov. Triangle‐factors in pseudorandom graphs , 2018, Bulletin of the London Mathematical Society.
[21] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[22] Vojtech Rödl,et al. On a Packing and Covering Problem , 1985, Eur. J. Comb..
[23] Noga Alon,et al. Explicit construction of linear sized tolerant networks , 2006, Discret. Math..