Rational exponents for hypergraph Turan problems

DOI10.4310/JOC.2019.V10.N1.A3MaRDI QIDQ1630685zbMATH OpenWikidataFDO

Authors Matthew Fitch

Publication date 10 December 2018

Published in Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65)

Abstract: Given a family of $k$-hypergraphs $mathcalF$, $ex(n,mathcalF)$ is the maximum number of edges a $k$-hypergraph can have, knowing that said hypergraph has $n$ vertices but contains no copy of any hypergraph from $mathcalF$ as a subgraph. We prove that for every rational $r$ between $0$ and $k-1$, there exists some finite family $mathcalF$ of $k$-hypergraphs for which $ex(n,mathcalF)=Theta(n^{k-r})$.

Recommendations

• Rational exponents in extremal graph theory
• New Turán Exponents for Two Extremal Hypergraph Problems
• scientific article; zbMATH DE number 1439495
• Some extremal results on hypergraph Turán problems
• Turán numbers for Berge-hypergraphs and related extremal problems
• scientific article; zbMATH DE number 5942358
• On Turán exponents of bipartite graphs
• On the rational Turán exponents conjecture
• The Turán problem for hypergraphs on fixed size
• Asymptotic solution of the Turán problem for some hypergraphs

Cited in

(11)

• All rationals occur as exponents
• Rational exponents in extremal graph theory
• On the rational Turán exponents conjecture
• On Hamiltonian cycles in hypergraphs with dense link graphs
• Hypergraphs without exponents
• Some extremal results on hypergraph Turán problems
• Degenerate Turán densities of sparse hypergraphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• New Turán Exponents for Two Extremal Hypergraph Problems
• Negligible Obstructions and Turán Exponents
• Rational exponents for cliques

This page was built for publication: Rational exponents for hypergraph Turan problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1630685)