Triangle factors in sparse pseudo-random graphs
From MaRDI portal
Publication:558243
DOI10.1007/s00493-004-0025-8zbMath1064.05119WikidataQ105583373 ScholiaQ105583373MaRDI QIDQ558243
Michael Krivelevich, Tibor Szabó, Benjamin Sudakov
Publication date: 5 July 2005
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-004-0025-8
05C80: Random graphs (graph-theoretic aspects)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Sparse pseudo‐random graphs are Hamiltonian, Turán's theorem for pseudo-random graphs, The smallest eigenvalue of \(K_{r}\)-free graphs