On uncrowded hypergraphs

DOI10.1002/rsa.3240060208zbMath0822.05051OpenAlexW2052723037WikidataQ105583243 ScholiaQ105583243MaRDI QIDQ4697811

Vojtěch Rödl, Richard A. Duke, Hanno Lefmann

Publication date: 5 October 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240060208

zbMATH Keywords

independence number\(k\)-uniform hypergraphconjecture of Spencer

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (33)

Independence in uniform linear triangle-free hypergraphs ⋮ Additive combinatorics and graph theory ⋮ Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs ⋮ On Subgraphs of Bounded Degeneracy in Hypergraphs ⋮ On the number of independent sets in simple hypergraphs ⋮ Large triangles in the \(d\)-dimensional unit cube ⋮ Codegree Turán Density of Complete $r$-Uniform Hypergraphs ⋮ Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth ⋮ Generalizations of Heilbronn's Triangle Problem ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Distributions of points in the unit square and large \(k\)-gons ⋮ No l Grid-Points in Spaces of Small Dimension ⋮ Extremal problems in hypergraph colourings ⋮ Large monochromatic components in 3‐edge‐colored Steiner triple systems ⋮ Infinite Sidon Sets Contained in Sparse Random Sets of Integers ⋮ Access balancing in storage systems by labeling partial Steiner systems ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the number of independent sets in uniform, regular, linear hypergraphs ⋮ New bounds on the field size for maximally recoverable codes instantiating grid-like topologies ⋮ On the Independence Number of Steiner Systems ⋮ On independent sets in hypergraphs ⋮ On the chromatic number of set systems ⋮ Distributions of points in \(d\) dimensions and large \(k\) -point simplices ⋮ The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers ⋮ Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems ⋮ Point sets in the unit square and large areas of convex hulls of subsets of points ⋮ On sets of points that determine only acute angles ⋮ A note on the random greedy independent set algorithm ⋮ On the independence number of non-uniform uncrowded hypergraphs ⋮ Counting Independent Sets in Hypergraphs ⋮ On Erdős-Rado numbers ⋮ \(F\)-factors in hypergraphs via absorption

Cites Work

• A note on Ramsey numbers
• Extremal uncrowded hypergraphs
• On Turan's theorem for sparse graphs
• Turan's theorem for \(k\)-graphs
• Note on independent sets in steiner systems

This page was built for publication: On uncrowded hypergraphs