The following pages link to On uncrowded hypergraphs (Q4697811):
Displaying 33 items.
- Independence in uniform linear triangle-free hypergraphs (Q279201) (← links)
- Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs (Q298341) (← links)
- On the independence number of non-uniform uncrowded hypergraphs (Q776287) (← links)
- Large triangles in the \(d\)-dimensional unit cube (Q860817) (← links)
- Distributions of points in \(d\) dimensions and large \(k\) -point simplices (Q958238) (← links)
- Point sets in the unit square and large areas of convex hulls of subsets of points (Q1016043) (← links)
- On sets of points that determine only acute angles (Q1024284) (← links)
- Additive combinatorics and graph theory (Q1620873) (← links)
- On the number of independent sets in simple hypergraphs (Q1646333) (← links)
- On Erdős-Rado numbers (Q1842571) (← links)
- Access balancing in storage systems by labeling partial Steiner systems (Q2205889) (← links)
- On the number of independent sets in uniform, regular, linear hypergraphs (Q2237850) (← links)
- New bounds on the field size for maximally recoverable codes instantiating grid-like topologies (Q2240731) (← links)
- \(F\)-factors in hypergraphs via absorption (Q2345534) (← links)
- Distributions of points in the unit square and large \(k\)-gons (Q2427543) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
- A note on the random greedy independent set algorithm (Q2830236) (← links)
- On Subgraphs of Bounded Degeneracy in Hypergraphs (Q3181066) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Generalizations of Heilbronn's Triangle Problem (Q3503518) (← links)
- No l Grid-Points in Spaces of Small Dimension (Q3511434) (← links)
- Codegree Turán Density of Complete $r$-Uniform Hypergraphs (Q4563373) (← links)
- Infinite Sidon Sets Contained in Sparse Random Sets of Integers (Q4602863) (← links)
- Large K<sub>r</sub>‐free subgraphs in K<sub>s</sub>‐free graphs and some other Ramsey‐type problems (Q4680408) (← links)
- On the Independence Number of Steiner Systems (Q4911171) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← links)
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers (Q5175228) (← links)
- On independent sets in hypergraphs (Q5409863) (← links)
- Counting Independent Sets in Hypergraphs (Q5495674) (← links)
- Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth (Q6074650) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Large monochromatic components in 3‐edge‐colored Steiner triple systems (Q6187431) (← links)
