Han, Jie; Hu, Ping; Wang, Guanghui; Yang, Donglei Clique-factors in graphs with sublinear \(\ell\)-independence number. (English) Zbl 1526.05073 Comb. Probab. Comput. 32, No. 4, 665-681 (2023). MSC: 05C35 05C48 05C07 PDFBibTeX XMLCite \textit{J. Han} et al., Comb. Probab. Comput. 32, No. 4, 665--681 (2023; Zbl 1526.05073) Full Text: DOI arXiv
Alon, Noga; Wei, Fan Irregular subgraphs. (English) Zbl 1511.05110 Comb. Probab. Comput. 32, No. 2, 269-283 (2023). MSC: 05C35 05C07 PDFBibTeX XMLCite \textit{N. Alon} and \textit{F. Wei}, Comb. Probab. Comput. 32, No. 2, 269--283 (2023; Zbl 1511.05110) Full Text: DOI arXiv
Böttcher, Julia; Parczyk, Olaf; Sgueglia, Amedeo; Skokan, Jozef Triangles in randomly perturbed graphs. (English) Zbl 1511.05206 Comb. Probab. Comput. 32, No. 1, 91-121 (2023). MSC: 05C80 05C35 05C70 PDFBibTeX XMLCite \textit{J. Böttcher} et al., Comb. Probab. Comput. 32, No. 1, 91--121 (2023; Zbl 1511.05206) Full Text: DOI arXiv
Allen, Peter; Böttcher, Julia; Ehrenmüller, Julia; Schnitzer, Jakob; Taraz, Anusch A spanning bandwidth theorem in random graphs. (English) Zbl 1510.05256 Comb. Probab. Comput. 31, No. 4, 598-628 (2022). MSC: 05C80 05C35 05C15 PDFBibTeX XMLCite \textit{P. Allen} et al., Comb. Probab. Comput. 31, No. 4, 598--628 (2022; Zbl 1510.05256) Full Text: DOI arXiv
Freschi, Andrea; Hyde, Joseph; Treglown, Andrew On deficiency problems for graphs. (English) Zbl 1510.05138 Comb. Probab. Comput. 31, No. 3, 478-488 (2022). MSC: 05C35 05C70 05C78 05B07 05B15 PDFBibTeX XMLCite \textit{A. Freschi} et al., Comb. Probab. Comput. 31, No. 3, 478--488 (2022; Zbl 1510.05138) Full Text: DOI arXiv
Pach, János; Tardos, Gábor; Tóth, Géza Disjointness graphs of segments in the space. (English) Zbl 1510.05083 Comb. Probab. Comput. 30, No. 4, 498-512 (2021). MSC: 05C15 05C62 05C85 68Q17 PDFBibTeX XMLCite \textit{J. Pach} et al., Comb. Probab. Comput. 30, No. 4, 498--512 (2021; Zbl 1510.05083) Full Text: DOI
Balogh, József; Csaba, Béla; Pluhár, András; Treglown, Andrew A discrepancy version of the Hajnal-Szemerédi theorem. (English) Zbl 1466.05174 Comb. Probab. Comput. 30, No. 3, 444-459 (2021). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{J. Balogh} et al., Comb. Probab. Comput. 30, No. 3, 444--459 (2021; Zbl 1466.05174) Full Text: DOI arXiv
Han, Jie; Lo, Allan; Sanhueza-Matamala, Nicolás Covering and tiling hypergraphs with tight cycles. (English) Zbl 1466.05182 Comb. Probab. Comput. 30, No. 2, 288-329 (2020). MSC: 05C70 05C65 05C38 05D99 PDFBibTeX XMLCite \textit{J. Han} et al., Comb. Probab. Comput. 30, No. 2, 288--329 (2020; Zbl 1466.05182) Full Text: DOI
Falgas-Ravry, Victor; Markström, Klas; Zhao, Yi Triangle-degrees in graphs and tetrahedron coverings in 3-graphs. (English) Zbl 1466.05180 Comb. Probab. Comput. 30, No. 2, 175-199 (2020). MSC: 05C70 05C35 05C65 05C30 PDFBibTeX XMLCite \textit{V. Falgas-Ravry} et al., Comb. Probab. Comput. 30, No. 2, 175--199 (2020; Zbl 1466.05180) Full Text: DOI arXiv
Grósz, Dániel; Methuku, Abhishek; Tompkins, Casey On subgraphs of \(C_{2k}\)-free graphs and a problem of Kühn and Osthus. (English) Zbl 1466.05068 Comb. Probab. Comput. 29, No. 3, 436-454 (2020). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{D. Grósz} et al., Comb. Probab. Comput. 29, No. 3, 436--454 (2020; Zbl 1466.05068) Full Text: DOI arXiv
Heckel, Annika Sharp concentration of the equitable chromatic number of dense random graphs. (English) Zbl 1466.05198 Comb. Probab. Comput. 29, No. 2, 213-233 (2020). Reviewer: Yilun Shang (Newcastle) MSC: 05C80 05C42 05C15 PDFBibTeX XMLCite \textit{A. Heckel}, Comb. Probab. Comput. 29, No. 2, 213--233 (2020; Zbl 1466.05198) Full Text: DOI arXiv
Nenadov, Rajko; Škorić, Nemanja On Komlós’ tiling theorem in random graphs. (English) Zbl 1436.05098 Comb. Probab. Comput. 29, No. 1, 113-127 (2020). MSC: 05C80 05C35 05B45 PDFBibTeX XMLCite \textit{R. Nenadov} and \textit{N. Škorić}, Comb. Probab. Comput. 29, No. 1, 113--127 (2020; Zbl 1436.05098) Full Text: DOI arXiv
Fox, Jacob; Li, Ray On Ramsey numbers of hedgehogs. (English) Zbl 1436.05071 Comb. Probab. Comput. 29, No. 1, 101-112 (2020). MSC: 05C55 05C65 PDFBibTeX XMLCite \textit{J. Fox} and \textit{R. Li}, Comb. Probab. Comput. 29, No. 1, 101--112 (2020; Zbl 1436.05071) Full Text: DOI arXiv
Balogh, József; McDowell, Andrew; Molla, Theodore; Mycroft, Richard Triangle-tilings in graphs without large independent sets. (English) Zbl 1391.05199 Comb. Probab. Comput. 27, No. 4, 449-474 (2018). MSC: 05C70 05C69 05B45 05C07 05D40 05C35 PDFBibTeX XMLCite \textit{J. Balogh} et al., Comb. Probab. Comput. 27, No. 4, 449--474 (2018; Zbl 1391.05199) Full Text: DOI arXiv
Loh, Po-Shen; Tait, Michael; Timmons, Craig; Zhou, Rodrigo M. Induced Turán numbers. (English) Zbl 1387.05123 Comb. Probab. Comput. 27, No. 2, 274-288 (2018). MSC: 05C35 05C69 05C60 PDFBibTeX XMLCite \textit{P.-S. Loh} et al., Comb. Probab. Comput. 27, No. 2, 274--288 (2018; Zbl 1387.05123) Full Text: DOI arXiv
Kierstead, H. A.; Kostochka, A. V.; McConvey, A. A sharp Dirac-Erdős type bound for large graphs. (English) Zbl 1390.05108 Comb. Probab. Comput. 27, No. 3, 387-397 (2018). MSC: 05C35 05C70 05C10 PDFBibTeX XMLCite \textit{H. A. Kierstead} et al., Comb. Probab. Comput. 27, No. 3, 387--397 (2018; Zbl 1390.05108) Full Text: DOI arXiv
Han, Jie; Lo, Allan; Treglown, Andrew; Zhao, Yi Exact minimum codegree threshold for \(K^-_4\)-factors. (English) Zbl 1374.05176 Comb. Probab. Comput. 26, No. 6, 856-885 (2017). MSC: 05C70 05C35 05C65 PDFBibTeX XMLCite \textit{J. Han} et al., Comb. Probab. Comput. 26, No. 6, 856--885 (2017; Zbl 1374.05176) Full Text: DOI arXiv
Yuster, Raphael On the maximum number of spanning copies of an orientation in a tournament. (English) Zbl 1371.05111 Comb. Probab. Comput. 26, No. 5, 775-796 (2017). MSC: 05C20 05C35 05C45 PDFBibTeX XMLCite \textit{R. Yuster}, Comb. Probab. Comput. 26, No. 5, 775--796 (2017; Zbl 1371.05111) Full Text: DOI arXiv
Gao, Wei; Han, Jie Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs. (English) Zbl 1371.05202 Comb. Probab. Comput. 26, No. 4, 536-559 (2017). MSC: 05C65 05C70 PDFBibTeX XMLCite \textit{W. Gao} and \textit{J. Han}, Comb. Probab. Comput. 26, No. 4, 536--559 (2017; Zbl 1371.05202) Full Text: DOI arXiv
Day, A. Nicholas Saturated graphs of prescribed minimum degree. (English) Zbl 1371.05140 Comb. Probab. Comput. 26, No. 2, 201-207 (2017). MSC: 05C35 05C07 PDFBibTeX XMLCite \textit{A. N. Day}, Comb. Probab. Comput. 26, No. 2, 201--207 (2017; Zbl 1371.05140) Full Text: DOI arXiv
Morrison, Natasha; Noel, Jonathan A.; Scott, Alex Saturation in the hypercube and bootstrap percolation. (English) Zbl 1371.05145 Comb. Probab. Comput. 26, No. 1, 78-98 (2017). MSC: 05C35 05C50 05D99 PDFBibTeX XMLCite \textit{N. Morrison} et al., Comb. Probab. Comput. 26, No. 1, 78--98 (2017; Zbl 1371.05145) Full Text: DOI arXiv
Johnson, J. Robert; Pinto, Trevor Saturated subgraphs of the hypercube. (English) Zbl 1371.05158 Comb. Probab. Comput. 26, No. 1, 52-67 (2017). MSC: 05C42 05C35 05C65 PDFBibTeX XMLCite \textit{J. R. Johnson} and \textit{T. Pinto}, Comb. Probab. Comput. 26, No. 1, 52--67 (2017; Zbl 1371.05158) Full Text: DOI arXiv
Clemens, Dennis; Person, Yury Minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs. (English) Zbl 1372.05147 Comb. Probab. Comput. 25, No. 6, 850-869 (2016). MSC: 05C65 05D10 05D40 PDFBibTeX XMLCite \textit{D. Clemens} and \textit{Y. Person}, Comb. Probab. Comput. 25, No. 6, 850--869 (2016; Zbl 1372.05147) Full Text: DOI
Hefetz, Dan; Tyomkyn, Mykhaylo Universality of graphs with few triangles and anti-triangles. (English) Zbl 1372.05107 Comb. Probab. Comput. 25, No. 4, 560-576 (2016). MSC: 05C35 05C60 PDFBibTeX XMLCite \textit{D. Hefetz} and \textit{M. Tyomkyn}, Comb. Probab. Comput. 25, No. 4, 560--576 (2016; Zbl 1372.05107) Full Text: DOI arXiv
Reed, Bruce; Wood, David R. Forcing a sparse minor. (English) Zbl 1372.05211 Comb. Probab. Comput. 25, No. 2, 300-322 (2016); corrigendum ibid. 25, No. 2, 323 (2016). MSC: 05C83 05C35 05D40 PDFBibTeX XMLCite \textit{B. Reed} and \textit{D. R. Wood}, Comb. Probab. Comput. 25, No. 2, 300--322 (2016; Zbl 1372.05211) Full Text: DOI arXiv
Czygrinow, Andrzej; DeBiasio, Louis; Kierstead, H. A.; Molla, Theodore An extension of the Hajnal-Szemerédi theorem to directed graphs. (English) Zbl 1371.05101 Comb. Probab. Comput. 24, No. 5, 754-773 (2015). MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{A. Czygrinow} et al., Comb. Probab. Comput. 24, No. 5, 754--773 (2015; Zbl 1371.05101) Full Text: DOI arXiv
Fox, Jacob; Pach, János Applications of a new separator theorem for string graphs. (English) Zbl 1287.05066 Comb. Probab. Comput. 23, No. 1, 66-74 (2014). MSC: 05C35 05C62 52C10 PDFBibTeX XMLCite \textit{J. Fox} and \textit{J. Pach}, Comb. Probab. Comput. 23, No. 1, 66--74 (2014; Zbl 1287.05066) Full Text: DOI arXiv
Král’, Daniel; Liu, Chun-Hung; Sereni, Jean-Sébastien; Whalen, Peter; Yilma, Zelealem B. A new bound for the 2/3 conjecture. (English) Zbl 1263.05052 Comb. Probab. Comput. 22, No. 3, 384-393 (2013). MSC: 05C35 05C15 05C55 05C69 05C70 PDFBibTeX XMLCite \textit{D. Král'} et al., Comb. Probab. Comput. 22, No. 3, 384--393 (2013; Zbl 1263.05052) Full Text: DOI arXiv
Balogh, Jozsef; Kemkes, Graeme; Lee, Choongbum; Young, Stephen J. Towards a weighted version of the Hajnal-Szemerédi theorem. (English) Zbl 1263.05049 Comb. Probab. Comput. 22, No. 3, 346-350 (2013). MSC: 05C35 05C70 05C72 05D40 PDFBibTeX XMLCite \textit{J. Balogh} et al., Comb. Probab. Comput. 22, No. 3, 346--350 (2013; Zbl 1263.05049) Full Text: DOI arXiv
Böttcher, Julia; Taraz, Anusch; Würfl, Andreas Perfect graphs of fixed density: counting and homogeneous sets. (English) Zbl 1248.05086 Comb. Probab. Comput. 21, No. 5, 661-682 (2012). MSC: 05C30 05C69 05C17 05C42 PDFBibTeX XMLCite \textit{J. Böttcher} et al., Comb. Probab. Comput. 21, No. 5, 661--682 (2012; Zbl 1248.05086) Full Text: DOI arXiv
Faudree, Ralph J.; Gould, Ronald J.; Jacobson, Michael S. Minimum degree and disjoint cycles in claw-free graphs. (English) Zbl 1241.05094 Comb. Probab. Comput. 21, No. 1-2, 129-139 (2012). MSC: 05C60 05C38 PDFBibTeX XMLCite \textit{R. J. Faudree} et al., Comb. Probab. Comput. 21, No. 1--2, 129--139 (2012; Zbl 1241.05094) Full Text: DOI
Balogh, József; Lee, Choongbum; Samotij, Wojciech Corrádi and Hajnal’s theorem for sparse random graphs. (English) Zbl 1241.05130 Comb. Probab. Comput. 21, No. 1-2, 23-55 (2012). MSC: 05C80 05C42 05C70 PDFBibTeX XMLCite \textit{J. Balogh} et al., Comb. Probab. Comput. 21, No. 1--2, 23--55 (2012; Zbl 1241.05130) Full Text: DOI arXiv
Csaba, B. On the Bollobás-Eldrige conjecture for bipartite graphs. (English) Zbl 1136.05029 Comb. Probab. Comput. 16, No. 5, 661-691 (2007). Reviewer: Péter Komjáth (Budapest) MSC: 05C35 PDFBibTeX XMLCite \textit{B. Csaba}, Comb. Probab. Comput. 16, No. 5, 661--691 (2007; Zbl 1136.05029) Full Text: DOI
Krivelevich, Michael \(K^ s\)-free graphs without large \(K^ r\)-free subgraphs. (English) Zbl 0810.05040 Comb. Probab. Comput. 3, No. 3, 349-354 (1994). Reviewer: A.Ruciński (Poznań) MSC: 05C35 05C80 PDFBibTeX XMLCite \textit{M. Krivelevich}, Comb. Probab. Comput. 3, No. 3, 349--354 (1994; Zbl 0810.05040) Full Text: DOI
Erdős, Paul; Hajnal, András; Simonovits, Miklós; Sós, Vera T.; Szemerédi, E. Turán-Ramsey theorems and \(K_p\)-independence numbers. (English) Zbl 0812.05031 Comb. Probab. Comput. 3, No. 3, 297-325 (1994). Reviewer: Z.Chen (Indianapolis) MSC: 05C35 05C55 05C15 05C50 PDFBibTeX XMLCite \textit{P. Erdős} et al., Comb. Probab. Comput. 3, No. 3, 297--325 (1994; Zbl 0812.05031) Full Text: DOI