The following pages link to Extremal uncrowded hypergraphs (Q1164072):
Displaying 31 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)
- Generalizations of Heilbronn's triangle problem (Q1039441) (← links)
- Probabilistic methods (Q1091406) (← links)
- A note on the independence number of triangle-free graphs. II (Q1186139) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- Additive combinatorics and graph theory (Q1620873) (← links)
- Sparse hypergraphs with low independence number (Q1705800) (← links)
- On Erdős-Rado numbers (Q1842571) (← links)
- Point sets with distinct distances (Q1900187) (← 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)
- 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)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- On uncrowded hypergraphs (Q4697811) (← 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)
- Independent sets in hypergraphs omitting an intersection (Q6052482) (← links)
- Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth (Q6074650) (← links)
- Heilbronn triangle‐type problems in the unit square [0,1]<sup>2</sup> (Q6074876) (← links)
- Independence number of hypergraphs under degree conditions (Q6076735) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- Coloring unions of nearly disjoint hypergraph cliques (Q6144279) (← links)
