Large cliques in hypergraphs with forbidden substructures

DOI10.1007/s00493-019-4169-yzbMath1474.05211arXiv1903.00245OpenAlexW3009933977MaRDI QIDQ2226629

Andreas F. Holmsen

Publication date: 8 February 2021

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberextremal graph theoryforbidden induced subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Helly-type theorems and geometric transversal theory (52A35)

Related Items (7)

Radon numbers grow linearly ⋮ RELATIVE LERAY NUMBERS VIA SPECTRAL SEQUENCES ⋮ Fractional Helly theorem for Cartesian products of convex sets ⋮ Graphs with no induced \(K_{2,t}\) ⋮ Quantitative fractional Helly and \((p,q)\)-theorems ⋮ Radon numbers and the fractional Helly theorem ⋮ Quantitative combinatorial geometry for concave functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the colorful fractional Helly theorem
• Cliques in \(C_4\)-free graphs of large minimum degree
• The colorful Helly theorem and colorful resolutions of ideals
• Large cliques in \(C_4\)-free graphs
• A topological colorful Helly theorem
• Intersection patterns of convex sets
• An upper-bound theorem for families of convex sets
• A generalization of Caratheodory's theorem
• A Turan type problem for interval graphs
• Transversal numbers for hypergraphs arising in geometry
• Helly’s theorem: New variations and applications
• A Problem of Geometry in R n
• Induced Turán Numbers
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On a problem of K. Zarankiewicz
• On the structure of linear graphs

This page was built for publication: Large cliques in hypergraphs with forbidden substructures