New Turán Exponents for Two Extremal Hypergraph Problems

DOI10.1137/20M1325769zbMath1453.05082arXiv2004.03099OpenAlexW3098082570MaRDI QIDQ5138977

Chong Shangguan, Itzhak Tamo

Publication date: 4 December 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

sparse hypergraphsunion-free hypergraphscancellative hypergraphshypergraph Turán-type problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Density (toughness, etc.) (05C42)

Cites Work

• Uniform hypergraphs containing no grids
• Union-free hypergraphs and probability theory
• On an extremal hypergraph problem of Brown, Erdős and Sós
• Families of finite sets in which no set is covered by the union of \(r\) others
• Union-free families of sets and equations over fields
• 2-Cancellative Hypergraphs and Codes
• Probabilistic Existence Results for Separable Codes
• New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback
• Sparse Hypergraphs with Applications to Coding Theory
• Nonrandom binary superimposed codes
• On Cancellative Set Families
• On coloring graphs to maximize the proportion of multicolored k-edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item