The following pages link to Lower bounds for Turán's problem (Q1065822):
Displaying 20 items.
- Hypergraphs with independent neighborhoods (Q653790) (← links)
- On set systems with a threshold property (Q856857) (← links)
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (Q1076037) (← links)
- Hypergraphs with high chromatic number (Q1086588) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube (Q1332422) (← links)
- On a two-sided Turán problem (Q1422128) (← links)
- What we know and what we do not know about Turán numbers (Q1895823) (← links)
- Improved bounds on a generalization of Tuza's conjecture (Q2094882) (← links)
- Stability and exact Turán numbers for matroids (Q2173427) (← links)
- Non-uniform Turán-type problems (Q2484510) (← links)
- Asymptotic improvements to the lower bound of certain bipartite Turán numbers (Q2888865) (← links)
- Lower Bounds for Coin-Weighing Problems (Q2947551) (← links)
- A lower bound for the mixed μ problem (Q3124451) (← links)
- Extremal problems on set systems (Q4543625) (← links)
- Coverings of r—graphs by complete r—partite subgraphs (Q4697821) (← links)
- Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers (Q4796016) (← links)
- Automata, Languages and Programming (Q5466452) (← links)
- Colorings of hypergraphs with large number of colors (Q5895162) (← links)
- Generalized Tuza's conjecture for random hypergraphs (Q6581615) (← links)
