Triangle factors in sparse pseudo-random graphs

DOI10.1007/s00493-004-0025-8zbMath1064.05119OpenAlexW2113407082WikidataQ105583373 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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (18)

Corrádi and Hajnal's Theorem for Sparse Random Graphs ⋮ Sparse pseudo‐random graphs are Hamiltonian ⋮ Turán's theorem for pseudo-random graphs ⋮ Finding any given 2‐factor in sparse pseudorandom graphs efficiently ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ Site percolation on pseudo‐random graphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ A construction for clique-free pseudorandom graphs ⋮ Powers of Hamilton cycles in pseudorandom graphs ⋮ Near-perfect clique-factors in sparse pseudorandom graphs ⋮ The smallest eigenvalue of \(K_{r}\)-free graphs ⋮ Additive patterns in multiplicative subgroups ⋮ Near-perfect clique-factors in sparse pseudorandom graphs ⋮ Multicolor Ramsey numbers via pseudorandom graphs ⋮ Triangle‐factors in pseudorandom graphs ⋮ Clique-factors in sparse pseudorandom graphs

This page was built for publication: Triangle factors in sparse pseudo-random graphs