Shattered matchings in intersecting hypergraphs

DOI10.2140/moscow.2021.10.49zbMath1459.05223arXiv2005.04880OpenAlexW3023787660MaRDI QIDQ2229336

János Pach, Peter Frankl

Publication date: 23 February 2021

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

matchingseparabilityextremal set theoryVapnik-Chervonenkis dimensionshattered set

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Turán number of generalized triangles
• Repeated columns and an old chestnut
• On disjointly representable sets
• Extremal problems whose solutions are the blowups of the small Witt- designs
• Combinatorial set theory: Partition relations for cardinals
• Three-graphs without two triples whose symmetric difference is contained in a third
• On the trace of finite sets
• Stability theorems for cancellative hypergraphs
• Small forbidden configurations. IV: The 3 rowed case
• Induced subsets
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Extremal Problems for Finite Sets
• A new generalization of the Erdős-Ko-Rado theorem