Embedding graphs with bounded degree in sparse pseudorandom graphs
From MaRDI portal
Publication:1885587
DOI10.1007/BF02787543zbMath1055.05138OpenAlexW2062632642WikidataQ105583410 ScholiaQ105583410MaRDI QIDQ1885587
Yoshiharu Kohayakawa, Papa Amar Sissokho, Vojtěch Rödl
Publication date: 11 November 2004
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02787543
Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (7)
A counting lemma for sparse pseudorandom hypergraphs ⋮ Counting results for sparse pseudorandom hypergraphs. I. ⋮ Turán's theorem for pseudo-random graphs ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ Extremal results in sparse pseudorandom graphs ⋮ Discrepancy and eigenvalues of Cayley graphs ⋮ The poset of hypergraph quasirandomness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- On universality of graphs with uniformly distributed edges
- Explicit construction of linear sized tolerant networks
- The number of submatrices of a given type in a Hadamard matrix and related results
- Eigenvalues and expanders
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Explicit Ramsey graphs and orthonormal labelings
- Sparse quasi-random graphs
- Quasi-random tournaments
- The Algorithmic Aspects of the Regularity Lemma
- Szemerédi’s Regularity Lemma for Sparse Graphs
- Regular pairs in sparse random graphs I
- An Optimal Algorithm for Checking Regularity
- The Turn Theorem for Random Graphs
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- Threshold Functions for Ramsey Properties
- Quasi-random graphs
This page was built for publication: Embedding graphs with bounded degree in sparse pseudorandom graphs
