On a conjecture of milner on k-graphs with non-disjoint edges

DOI10.1016/S0021-9800(68)80049-3MaRDI QIDQ5554166zbMATH OpenOpenAlexWikidataFDO

Authors Daniel J. Kleitman

Publication date 1968

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0021-9800(68)80049-3

zbMATH Keywords

topology

Cited in

(15)

• Threshold graphs, shifted complexes, and graphical complexes
• Extremal problems among subsets of a set. (Reprint)
• On the number of latent subsets of intersecting collections
• The size of a hypergraph and its matching number
• Finite projective spaces and intersecting hypergraphs
• The realization of distances within sets in Euclidean space
• Contributions to the geometry of Hamming spaces
• Algebraic Shifting of Finite Graphs
• Extremal problems among subsets of a set
• Families of intersecting finite vector spaces
• A generalization of a theorem of Kruskal
• Generalizations of theorems of Katona and Milner
• Improved bounds for cross-Sperner systems
• A new generalization of the Erdős-Ko-Rado theorem
• On systems of finite sets with constraints on their unions and intersections

This page was built for publication: On a conjecture of milner on k-graphs with non-disjoint edges

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