On uncrowded hypergraphs

DOI10.1002/RSA.3240060208MaRDI QIDQ4697811zbMATH OpenOpenAlexWikidataFDO

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

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)

Recommendations

• On the independence number of non-uniform uncrowded hypergraphs
• Independence numbers of hypergraphs with sparse neighborhoods.
• On vertex independence number of uniform hypergraphs
• On independent sets in hypergraphs
• Independence number of hypergraphs under degree conditions

Cites work

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

Cited in

(43)

• Distributions of points in \(d\) dimensions and large \(k\) -point simplices
• Distributions of points in the unit square and large \(k\)-gons
• Large monochromatic components in 3‐edge‐colored Steiner triple systems
• scientific article; zbMATH DE number 16113 (Why is no real title available?)
• Sparse hypergraphs with applications to coding theory
• On subgraphs of bounded degeneracy in hypergraphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Coloring simple hypergraphs
• Independence in uniform linear triangle-free hypergraphs
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• Independent sets in hypergraphs
• Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth
• On independent sets in hypergraphs
• Independence numbers of hypergraphs with sparse neighborhoods.
• New bounds on the field size for maximally recoverable codes instantiating grid-like topologies
• Large triangles in the \(d\)-dimensional unit cube
• Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs
• Extremal problems in hypergraph colourings
• On the independence number of Steiner systems
• Generalizations of Heilbronn's Triangle Problem
• On the number of independent sets in simple hypergraphs
• Counting Independent Sets in Hypergraphs
• No l Grid-Points in Spaces of Small Dimension
• Point sets in the unit square and large areas of convex hulls of subsets of points
• Independence number of hypergraphs under degree conditions
• \(F\)-factors in hypergraphs via absorption
• Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems
• On sets of points that determine only acute angles
• Access balancing in storage systems by labeling partial Steiner systems
• On the number of independent sets in uniform, regular, linear hypergraphs
• On Erdős-Rado numbers
• Graph and hypergraph colouring via nibble methods: a survey
• On the independence number of non-uniform uncrowded hypergraphs
• A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R
• Codegree Turán density of complete r-uniform hypergraphs
• Some combinatorial algorithms on the independent number of k-regular connected hypergraphs
• The Algorithmic Aspects of Uncrowded Hypergraphs
• A note on the random greedy independent set algorithm
• On the off-diagonal unordered Erdős-Rado numbers
• Approximate hypergraph vertex cover and generalized Tuza's conjecture
• On the chromatic number of set systems
• Infinite Sidon sets contained in sparse random sets of integers
• Additive combinatorics and graph theory

This page was built for publication: On uncrowded hypergraphs

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