The following pages link to (Q5672676):
Displaying 43 items.
- Regular subgraphs of uniform hypergraphs (Q273181) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- A new proof of the graph removal lemma (Q640795) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Induced subgraphs of given sizes (Q1301633) (← links)
- On generalized Ramsey theory: The bipartite case (Q1850469) (← links)
- Hypergraphs without exponents (Q2049452) (← links)
- Turán and Ramsey numbers in linear triple systems. II (Q2092409) (← links)
- A new bound for the Brown-Erdős-Sós problem (Q2101162) (← links)
- Some extremal results on hypergraph Turán problems (Q2158853) (← links)
- The linear Turán number of small triple systems or why is the wicket interesting? (Q2166284) (← links)
- Sparse hypergraphs: new bounds and constructions (Q2222044) (← links)
- Turán and Ramsey numbers in linear triple systems (Q2222956) (← links)
- Turán number of special four cycles in triple systems (Q2237241) (← links)
- Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
- Turán numbers and batch codes (Q2345596) (← links)
- Odd cycles and \(\Theta\)-cycles in hypergraphs (Q2433709) (← links)
- Nonexistence of sparse triple systems over abelian groups and involutions (Q2458260) (← links)
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\) (Q2461770) (← links)
- Non-uniform Turán-type problems (Q2484510) (← links)
- (Q2760448) (← links)
- On topological minors in random simplicial complexes (Q2790287) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A note on the Brown–Erdős–Sós conjecture in groups (Q4993109) (← links)
- Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← links)
- New Turán Exponents for Two Extremal Hypergraph Problems (Q5138977) (← links)
- Constructing dense grid-free linear $3$-graphs (Q5164032) (← links)
- Triple systems with no three triples spanning at most five points (Q5229522) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- The regularity method for graphs with few 4‐cycles (Q5874028) (← links)
- The length of an <i>s</i>-increasing sequence of <i>r</i>-tuples (Q5886106) (← links)
- Optimal combinatorial batch codes based on block designs (Q5963364) (← links)
- Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity (Q6046820) (← links)
- The Erdős–Gyárfás function with respect to Gallai‐colorings (Q6081587) (← links)
- Approximate Steiner (<i>r</i> − 1, <i>r</i>, <i>n</i>)‐systems without three blocks on <i>r</i> + 2 points (Q6185555) (← links)
- Singleton-type bounds for list-decoding and list-recovery, and related results (Q6187335) (← links)
- Local-vs-global combinatorics (Q6198642) (← links)
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846) (← links)
- On the \((6,4)\)-problem of Brown, Erdős, and Sós (Q6562822) (← links)
- Turán numbers of \(r\)-graphs on \(r + 1\) vertices (Q6615752) (← links)
- Turán numbers and switching (Q6646399) (← links)
- Proper edge colorings of planar graphs with rainbow \(C_4\)-s (Q6657589) (← links)
- Total mutual-visibility in Hamming graphs (Q6667291) (← links)
