Degenerate Turán densities of sparse hypergraphs

DOI10.1016/J.JCTA.2020.105228MaRDI QIDQ2306000zbMATHOpenAlexFDO

Authors Chong Shangguan, Itzhak Tamo

Publication date 20 March 2020

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

algebraic constructionsparse hypergraphapproximate decomposition of the complete graphdegenerate Turán density

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Hypergraphs (05C65) Triple systems (05B07)

Abstract: For fixed integers $r>kge2,ege3$, let $f_r(n,er-(e-1)k,e)$ be the maximum number of edges in an $r$-uniform hypergraph in which the union of any $e$ distinct edges contains at least $er-(e-1)k+1$ vertices. A classical result of Brown, ErdH{o}s and S'os in 1973 showed that $f_r(n,er-(e-1)k,e)=Theta(n^k).$ The degenerate Tur'an density is defined to be the limit (if it exists) ${\displaystyle }$pi(r,k,e):=lim_{n ightarrowinfty}frac{f_r(n,er-(e-1)k,e)}{n^k}.${\displaystyle }$ Extending a recent result of Glock for the special case of $r=3,k=2,e=3$, we show that ${\displaystyle }$pi(r,2,3):=lim_{n ightarrowinfty}frac{f_r(n,3r-4,3)}{n^2}=frac{1}{r^2-r-1}${\displaystyle }$ for arbitrary fixed $rge4$. For the more general cases $r>kge3$, we show that ${\displaystyle }$frac{1}{r^k-r}leliminf_{n ightarrowinfty}frac{f_r(n,3r-2k,3)}{n^k}lelimsup_{n ightarrowinfty}frac{f_r(n,3r-2k,3)}{n^k}le frac{1}{k!�inom{r}{k}-frac{k!}{2}}.${\displaystyle }$ The main difficulties in proving these results are the constructions establishing the lower bounds. The first construction is recursive and purely combinatorial, and is based on a (carefully designed) approximate induced decomposition of the complete graph, whereas the second construction is algebraic, and is proved by a newly defined matrix property which we call {it strongly 3-perfect hashing}.

Recommendations

• Some extremal results on complete degenerate hypergraphs
• Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity
• Sparse hypergraphs: new bounds and constructions
• Turán densities of some hypergraphs related to \(K_{k+1}^{k}\)
• On the Turán density of \(\{1, 3\}\)-hypergraphs

Cites work

• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 5130822 (Why is no real title available?)
• scientific article; zbMATH DE number 4104975 (Why is no real title available?)
• scientific article; zbMATH DE number 3561377 (Why is no real title available?)
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 3224335 (Why is no real title available?)
• scientific article; zbMATH DE number 3258067 (Why is no real title available?)
• scientific article; zbMATH DE number 3407723 (Why is no real title available?)
• 2-cancellative hypergraphs and codes
• A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
• An extension of the Ruzsa-Szemerédi theorem
• Disjoint systems
• Large girth approximate Steiner triple systems
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
• On a hypergraph matching problem
• On a packing and covering problem
• On a problem of K. Zarankiewicz
• On an extremal hypergraph problem of Brown, Erdős and Sós
• On extremal problems of graphs and generalized graphs
• On the Size of Separating Systems and Families of Perfect Hash Functions
• On the combinatorial problems which I would most like to see solved
• On the existence of triangulated spheres in 3-graphs, and related problems
• Problems and results in combinatorial analysis and graph theory
• Rational exponents for hypergraph Turan problems
• Rational exponents in extremal graph theory
• Separating hash families: a Johnson-type bound and new constructions
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The difference between consecutive primes. II
• The history of degenerate (bipartite) extremal graph problems
• The probabilistic method
• Triple systems with no three triples spanning at most five points
• Uniform hypergraphs containing no grids

Cited in

(14)

• Hypergraph Turán densities can have arbitrarily large algebraic degree
• Sparse hypergraphs with applications to coding theory
• Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points
• On subgraphs of bounded degeneracy in hypergraphs
• On 2-parent-identifying set systems of block size 4
• Some extremal results on complete degenerate hypergraphs
• On the \((6,4)\)-problem of Brown, Erdős, and Sós
• Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
• On the Turán density of \(\{1, 3\}\)-hypergraphs
• Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
• Non-jumping Turán densities of hypergraphs
• Sparse hypergraphs: new bounds and constructions
• A note on the structure of Turán densities of hypergraphs
• Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity

This page was built for publication: Degenerate Turán densities of sparse hypergraphs

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