Extremal results for odd cycles in sparse pseudorandom graphs

Link:
Autor/in:
Erscheinungsjahr:
2013
Medientyp:
Text
Schlagworte:
  • Graph in graph theory
  • Hypergraph
  • R-uniform hypergraph
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
  • Odd cycles
  • Extremal graph theory
  • Pseudorandom graphs
  • Graph in graph theory
  • Hypergraph
  • R-uniform hypergraph
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
Beschreibung:
  • We consider extremal problems for subgraphs of pseudorandom graphs. Our results implies that for (n, d, λ)-graphs Γ satisfying. λ2k-1≪d2kn(logn)-2(k-1)(2k-1) any subgraph G⊂. Γ not containing a cycle of length 2. k+. 1 has relative density at most 12+o(1). Up to the polylog-factor the condition on λ is best possible and was conjectured by Krivelevich, Lee and Sudakov. © 2013 .
Lizenz:
  • info:eu-repo/semantics/restrictedAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/13dc4d30-50ea-4738-aa6e-b43ce34a611b