On a conjecture of milner on k-graphs with non-disjoint edges
From MaRDI portal
Publication:5554166
DOI10.1016/S0021-9800(68)80049-3zbMath0167.22204OpenAlexW2013082809WikidataQ122904859 ScholiaQ122904859MaRDI QIDQ5554166
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
Related Items (15)
The Size of a Hypergraph and its Matching Number ⋮ Finite projective spaces and intersecting hypergraphs ⋮ Improved bounds for cross-Sperner systems ⋮ The realization of distances within sets in Euclidean space ⋮ Threshold graphs, shifted complexes, and graphical complexes ⋮ A new generalization of the Erdős-Ko-Rado theorem ⋮ Algebraic Shifting of Finite Graphs ⋮ Families of intersecting finite vector spaces ⋮ Generalizations of theorems of Katona and Milner ⋮ Extremal problems among subsets of a set. (Reprint) ⋮ Contributions to the geometry of Hamming spaces ⋮ On systems of finite sets with constraints on their unions and intersections ⋮ Extremal problems among subsets of a set ⋮ On the number of latent subsets of intersecting collections ⋮ A generalization of a theorem of Kruskal
This page was built for publication: On a conjecture of milner on k-graphs with non-disjoint edges
