On the trace of finite sets

DOI10.1016/0097-3165(83)90038-9zbMath0505.05001OpenAlexW2114935567MaRDI QIDQ1835917

Peter Frankl

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0097-3165(83)90038-9

zbMATH Keywords

family of subsetsTuran number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items (45)

Multicoloured extremal problems ⋮ Embeddings and the trace of finite sets ⋮ Some best possible bounds concerning the traces of finite sets ⋮ On the density of sets of divisors ⋮ Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension ⋮ New conjectures for union-closed families ⋮ Polynomal-size Frege proofs of Bollobás' theorem on the trace of sets ⋮ VC-saturated set systems ⋮ Convex geometries are extremal for the generalized Sauer-Shelah bound ⋮ A generalization of Sauer's lemma ⋮ Some best possible bounds concerning the traces of finite sets. II ⋮ Small forbidden configurations ⋮ Defect Sauer results ⋮ QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS ⋮ Bounding one-way differences ⋮ A forbidden configuration theorem of Alon ⋮ What convex geometries tell about shattering-extremal systems ⋮ Rounds in combinatorial search ⋮ Edge Multiplicity and Other Trace Functions ⋮ The journey of the union-closed sets conjecture ⋮ Exploring implications of trace (inversion) formula and Artin algebras in extremal combinatorics ⋮ Four-vertex traces of finite sets ⋮ Random low-degree polynomials are hard to approximate ⋮ A Sauer-Shelah-Perles lemma for lattices ⋮ Shattered matchings in intersecting hypergraphs ⋮ Arrow relations on families of finite sets ⋮ Constrained versions of Sauer's Lemma ⋮ On the complexity of constrained VC-classes ⋮ On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property ⋮ On forbidden submatrices ⋮ Forbidden subposet problems for traces of set families ⋮ On extremal problems concerning the traces of sets ⋮ Theory of Classification: a Survey of Some Recent Advances ⋮ Traces of antichains ⋮ Traces of hypergraphs ⋮ On the VC-dimension and boolean functions with long runs ⋮ VC dimension and a union theorem for set systems ⋮ Shatter Functions with Polynomial Growth Rates ⋮ On the number of sets in a null t-design ⋮ Disjoint representability of sets and their complements ⋮ The VC-dimension of Sperner systems ⋮ On disjointly representable sets ⋮ Hypergraphs without a large star ⋮ An extremal problem for Graham-Rothschild parameter words ⋮ Density results for uniform families

Cites Work

• A simple proof of the Kruskal-Katona theorem
• Induced subsets
• On the density of families of sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the trace of finite sets