Disperse hypergraphs

DOI10.1017/S0963548325100205MaRDI QIDQ7303681zbMATH OpenFDO

Authors Lior Gishboliner, Ethan Honest

Publication date 24 July 2026

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S0963548325100205

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Ramsey theory (05D10)

Cites work

• Combinatorial Theorems on Classifications of Subsets of a Given Set
• Complete partite subgraphs in dense hypergraphs
• Erdős-Hajnal-type theorems in hypergraphs
• Induced subgraph density. I: A loglog step towards Erdős-Hajnal
• Large cliques or cocliques in hypergraphs with forbidden order-size pairs
• Note on independent sets in steiner systems
• On 3‐graphs with no four vertices spanning exactly two edges
• Ramsey-type theorems
• The Erdős-Szekeres problem and an induced Ramsey question
• Turan's theorem for k-graphs
• Two Erdős-Hajnal-type theorems in hypergraphs

This page was built for publication: Disperse hypergraphs

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