The following pages link to (Q3089368):
Displaying 50 items.
- High dimensional Hoffman bound and applications in extremal combinatorics (Q2700317) (← links)
- Stability theorems for some Kruskal-Katona type results (Q2700976) (← links)
- On the maximum quartet distance between phylogenetic trees (Q2800184) (← links)
- Codegree thresholds for covering 3-uniform hypergraphs (Q2826217) (← links)
- The Codegree Threshold for 3-Graphs with Independent Neighborhoods (Q2944457) (← links)
- Turán problems for integer-weighted graphs (Q3150169) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- (Q3360904) (← links)
- A hypergraph regularity method for generalized Turán problems (Q3608316) (← links)
- Extremal Problems on the Hypercube and the Codegree Turán Density of Complete $r$-Graphs (Q4556950) (← links)
- Codegree Turán Density of Complete $r$-Uniform Hypergraphs (Q4563373) (← links)
- Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers (Q4610452) (← links)
- Turánnical hypergraphs (Q4903276) (← links)
- Supersaturation of even linear cycles in linear hypergraphs (Q4987256) (← links)
- Turán numbers of theta graphs (Q4993102) (← links)
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)
- On the Codegree Density of $PG_m(q)$ (Q5001843) (← links)
- A Ramsey variant of the Brown–Erdős–Sós conjecture (Q5021660) (← links)
- An Irrational Lagrangian Density of a Single Hypergraph (Q5067428) (← links)
- Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$ (Q5071102) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems (Q5126774) (← links)
- $t$-Wise Berge and $t$-Heavy Hypergraphs (Q5128511) (← links)
- Semantic limits of dense combinatorial objects (Q5138464) (← links)
- Relative Turán Problems for Uniform Hypergraphs (Q5157384) (← links)
- On the Chromatic Thresholds of Hypergraphs (Q5366886) (← links)
- A Bound on the Number of Edges in Graphs Without an Even Cycle (Q5366930) (← links)
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians (Q5366952) (← links)
- A hypergraph Turán theorem via Lagrangians of intersecting families (Q5419938) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)
- Finding the shortest path for a Hypergraph (Q5866018) (← links)
- Simplicial homeomorphs and trace-bounded hypergraphs (Q5871268) (← links)
- Universal and unavoidable graphs (Q5886120) (← links)
- Hypergraph Turán densities can have arbitrarily large algebraic degree (Q6038595) (← links)
- On supersaturation and stability for generalized Turán problems (Q6055938) (← links)
- Turán and Ramsey numbers for 3‐uniform minimal paths of length 4 (Q6056754) (← links)
- Turán numbers for disjoint paths (Q6056755) (← links)
- Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph (Q6056777) (← links)
- Multicolor list Ramsey numbers grow exponentially (Q6057634) (← links)
- Lagrangian-perfect hypergraphs (Q6084663) (← links)
- On Turán numbers for disconnected hypergraphs (Q6111798) (← links)
- Uniform Turán density of cycles (Q6112889) (← links)
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm (Q6133947) (← links)
- Many Cliques in Bounded-Degree Hypergraphs (Q6170441) (← links)
- On the Turán density of uniform hypergraphs (Q6173977) (← links)
- Dirac-type conditions for spanning bounded-degree hypertrees (Q6187344) (← links)
- Restricted problems in extremal combinatorics (Q6198640) (← links)
- Unavoidable order-size pairs in hypergraphs -- positive forcing density (Q6204681) (← links)
- Turán theorems for even cycles in random hypergraph (Q6500098) (← links)
- Turán problems for mixed graphs (Q6500101) (← links)
