Intersection theorems for systems of sets
From MaRDI portal
Publication:2555852
DOI10.1016/0097-3165(72)90103-3zbMath0247.05004OpenAlexW2018421682MaRDI QIDQ2555852
H. L. Abbott, Norbert W. Sauer, Denis Hanson
Publication date: 1972
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(72)90103-3
Related Items
Regular subgraphs of uniform hypergraphs ⋮ Spectral extremal graphs for intersecting cliques ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ Pseudo sunflowers ⋮ Exact solution of some Turán-type problems ⋮ Intersection statements for systems of sets ⋮ Extremal graphs for edge blow-up of graphs ⋮ Generalized Turán problems for double stars ⋮ Inverting the Turán problem ⋮ Turán number for odd‐ballooning of trees ⋮ Uniform hypergraphs under certain intersection constraints between hyperedges ⋮ Tree automata and pigeonhole classes of matroids. II ⋮ Turán graphs with bounded matching number ⋮ On Turán problems with bounded matching number ⋮ On fan-saturated graphs ⋮ The maximum spectral radius of graphs without friendship subgraphs ⋮ Extremal graphs for intersecting cliques ⋮ Generalization of Erdős-Gallai edge bound ⋮ The Turán number for the edge blow-up of trees ⋮ On set systems not containing delta systems ⋮ Sunflowers and -intersecting families ⋮ On finite \(\Delta\)-systems ⋮ On the critical point-arboricity graphs ⋮ Degrees and matchings ⋮ Extremal problems among subsets of a set. (Reprint) ⋮ On finite Delta-systems. II ⋮ A note on stability for maximal \(F\)-free graphs ⋮ Matchings and covers in hypergraphs ⋮ An extremal problem for 3-graphs ⋮ A note on weak delta systems ⋮ Graphs with restricted valency and matching number ⋮ Extremal problems among subsets of a set ⋮ Stirling numbers and records
Cites Work
