Four-vertex traces of finite sets

DOI10.1007/s00373-023-02738-5arXiv2301.05830MaRDI QIDQ6144497

Jian Wang, Peter Frankl

Publication date: 29 January 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

extremal set theorytracesarrow relationZykov's symmetrization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact result for 3-graphs
• Extremal problems whose solutions are the blowups of the small Witt- designs
• Three-graphs without two triples whose symmetric difference is contained in a third
• An upper bound for the Turán number \(t_3(n,4)\)
• Sperner families of bounded VC-dimension
• Traces of antichains
• On the trace of finite sets
• Graphs without quadrilaterals
• A new construction for cancellative families of sets
• On the number of edges of quadrilateral-free graphs
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On Graphs that do not Contain a Thomsen Graph
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On a problem of K. Zarankiewicz