Turán numbers of sunflowers

DOI10.1090/proc/16160zbMath1505.05121arXiv2110.11319OpenAlexW4311742616MaRDI QIDQ5060342

Matija Bucić, Domagoj Bradač, Benjamin Sudakov

Publication date: 10 January 2023

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

extremal set theory\(n\)-vertex Turán number of a sunflowerhypergraph made by a sunflower

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial optimization (90C27) Enumeration in graph theory (05C30) Extremal set theory (05D05) Congruences; primitive roots; residue systems (11A07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Graph designs and isomorphic decomposition (05C51)

Related Items (1)

On extremal spectral radius of blow-up uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• On the maximum number of edges in a hypergraph with given matching number
• On unavoidable graphs
• Unavoidable stars in 3-graphs
• On a packing and covering problem
• Forbidding just one intersection
• Exact solution of some Turán-type problems
• Intersection theorems with geometric consequences
• Proof of the Erdős matching conjecture in a new range
• Bounds on pairs of families with restricted intersections
• Unavoidable hypergraphs
• Note on sunflowers
• Improved bounds for the sunflower lemma
• Submodular minimization under congruency constraints
• Frankl-Rödl-type theorems for codes and permutations
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• Forbidden vector‐valued intersections
• A Partition Property of Simplices in Euclidean Space
• Forbidden Intersections
• An extremal problem for 3-graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• Coding for Sunflowers
• On unavoidable hypergraphs
• CSPs with global modular constraints: algorithms and hardness via polynomial representations

This page was built for publication: Turán numbers of sunflowers