Extremal results for odd cycles in sparse pseudorandom graphs

DOI10.1007/S00493-014-2912-YzbMath1349.05176arXiv1602.03663OpenAlexW3102632385MaRDI QIDQ484999

Elad Aigner-Horev, Mathias Schacht, Hiệp Hàn

Publication date: 8 January 2015

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.03663

zbMATH Keywords

extremal problemsTurán densitypseudorandom graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Density (toughness, etc.) (05C42)

Related Items (2)

Extremal results in sparse pseudorandom graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Turán's theorem for pseudo-random graphs
• Eigenvalues and expanders
• Explicit Ramsey graphs and orthonormal labelings
• Approximating the independence number via the \(\vartheta\)-function
• On \(K^ 4\)-free subgraphs of random graphs
• Turán's extremal problem in random graphs: Forbidding even cycles
• Turán's extremal problem in random graphs: Forbidding odd cycles
• Resilient Pancyclicity of Random and Pseudorandom Graphs
• Explicit Concentrators from Generalized N-Gons
• Extremal subgraphs of random graphs
• A generalization of Turán's theorem
• A Spectral Turán Theorem
• On the structure of linear graphs

This page was built for publication: Extremal results for odd cycles in sparse pseudorandom graphs