Triangle factors in sparse pseudo-random graphs
From MaRDI portal
Publication:558243
DOI10.1007/S00493-004-0025-8zbMATH Open1064.05119OpenAlexW2113407082WikidataQ105583373 ScholiaQ105583373MaRDI QIDQ558243FDOQ558243
Michael Krivelevich, Tibor Szabó, Benny 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
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (19)
- Title not available (Why is that?)
- Multicolor Ramsey numbers via pseudorandom graphs
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Triangle factors of graphs without large independent sets and of weighted graphs
- Additive patterns in multiplicative subgroups
- A Ramsey–Turán theory for tilings in graphs
- Triangle‐factors in pseudorandom graphs
- A construction for clique-free pseudorandom graphs
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- Powers of Hamilton cycles in pseudorandom graphs
- Finding any given 2‐factor in sparse pseudorandom graphs efficiently
- Corrádi and Hajnal's theorem for sparse random graphs
- The smallest eigenvalue of \(K_{r}\)-free graphs
- Near-perfect clique-factors in sparse pseudorandom graphs
- Near-perfect clique-factors in sparse pseudorandom graphs
- Turán's theorem for pseudo-random graphs
- Sparse pseudo‐random graphs are Hamiltonian
- Site percolation on pseudo‐random graphs
- Clique-factors in sparse pseudorandom graphs
Recommendations
This page was built for publication: Triangle factors in sparse pseudo-random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558243)
