Turan's theorem for \(k\)-graphs
From MaRDI portal
Publication:2552511
DOI10.1016/0012-365X(72)90084-2zbMath0237.05116MaRDI QIDQ2552511
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (31)
On Subgraphs of Bounded Degeneracy in Hypergraphs ⋮ Short proofs of some extremal results. II. ⋮ Ramsey-type results for semi-algebraic relations ⋮ General position subsets and independent hyperplanes in \(d\)-space ⋮ On vertex independence number of uniform hypergraphs ⋮ Independent sets in hypergraphs omitting an intersection ⋮ Independence number of hypergraphs under degree conditions ⋮ Degree sequences of random graphs ⋮ No l Grid-Points in Spaces of Small Dimension ⋮ New results on \(k\)-independence of hypergraphs ⋮ Trivial colors in colorings of Kneser graphs ⋮ Ramsey numbers of cliques versus monotone paths ⋮ Decomposition of Multiple Packings with Subquadratic Union Complexity ⋮ Embeddings of Ultrametric Spaces in Finite Dimensional Structures ⋮ Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques ⋮ Sparse hypergraphs with low independence number ⋮ Access balancing in storage systems by labeling partial Steiner systems ⋮ Triangles in graphs without bipartite suspensions ⋮ On Turan's theorem for sparse graphs ⋮ An improvement on the number of simplices in \(\mathbb{F}_q^d\) ⋮ Incidences between points and generalized spheres over finite fields and related problems ⋮ On order types of systems of segments in the plane ⋮ The intersection numbers of a complex ⋮ On Turan hypergraphs ⋮ On uncrowded hypergraphs ⋮ Point sets in the unit square and large areas of convex hulls of subsets of points ⋮ Efficient computation of sparse structures ⋮ On the independence number of non-uniform uncrowded hypergraphs ⋮ A note on a problem of Erdős on right angles ⋮ On a geometric combinatorial problem ⋮ Sidon sets in groups and induced subgraphs of Cayley graphs
Cites Work
This page was built for publication: Turan's theorem for \(k\)-graphs
