Intersection theorems for systems of sets

DOI10.1016/0097-3165(72)90103-3MaRDI QIDQ2555852zbMATH OpenOpenAlexFDO

Authors H. L. Abbott, D. Hanson, Norbert Sauer

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

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Permutations, words, matrices (05A05)

Cites work

• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• Intersection Theorems for Systems of Sets
• Some Remarks on a Combinatorial Theorem of Erdös and Rado

Cited in

(54)

• Graphs with restricted valency and matching number
• Stirling numbers and records
• Exact solution of some Turán-type problems
• On set systems not containing delta systems
• On finite \(\Delta\)-systems
• Degrees and matchings
• On finite Delta-systems. II
• Intersection statements for systems of sets
• Extremal graphs for intersecting cliques
• Matchings and covers in hypergraphs
• Extremal problems among subsets of a set
• A note on stability for maximal \(F\)-free graphs
• Spectral extremal graphs for intersecting cliques
• The spectral radius of graphs with no intersecting odd cycles
• Pseudo sunflowers
• The maximum spectral radius of graphs without friendship subgraphs
• The Turán number for the edge blow-up of trees
• A note on weak delta systems
• Inverting the Turán problem
• Extremal problems among subsets of a set. (Reprint)
• Extremal graphs for edge blow-up of graphs
• Regular subgraphs of uniform hypergraphs
• On the critical point-arboricity graphs
• An extremal problem for 3-graphs
• Generalization of Erdős-Gallai edge bound
• Sunflowers and L-intersecting families
• Generalized Turán problems for double stars
• 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
• Odd-sunflowers
• Generalized Turán results for edge blow-up of star forests
• Turán number of the odd-ballooning of complete bipartite graphs
• On generalized Turán numbers of intersecting cliques
• Extremal graphs for the suspension of edge-critical graphs
• Spectral extrema of graphs: forbidden linear forests and non-bipartite graphs
• Spectral extrema of graphs: forbidden cliques and star forests
• The evolution of unavoidable bichromatic patterns and extremal cases of balanceability
• Spectral extremal results on edge blow-up of graphs
• The exact Turán number of disjoint graphs -- a generalization of Simonovits' theorem, and beyond
• The number of edges in graphs with bounded clique number and circumference
• New bounds on families without large sunflowers
• Edge mappings of graphs: Turán type parameters
• The maximum number of edges in a \(\{K_{r+1},M_{k+1}\}\)-free graph
• Extremal problems for a matching and any other graph
• On the number of \(F_{k,4}\)-saturating edges
• Odd-sunflowers (extended abstract)
• Some stability results for spectral extremal problems of graphs with bounded matching number
• Sunflowers in set systems of bounded dimension
• Turán numbers of cycles plus a general graph
• Anti-Ramsey number of the star and matching family

This page was built for publication: Intersection theorems for systems of sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2555852)