The following pages link to (Q5512796):
Displayed 38 items.
- New bounds for a hypergraph bipartite Turán problem (Q2194765) (← links)
- Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs (Q2216926) (← links)
- Analytic methods for uniform hypergraphs (Q2250784) (← links)
- Asymptotic solution of a Turán-type problem (Q2276984) (← links)
- A note on Turán's theorem (Q2279574) (← links)
- Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
- Boundedness of optimal matrices in extremal multigraph and digraph problems (Q2367447) (← links)
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles (Q2421871) (← links)
- Non-jumping numbers for 5-uniform hypergraphs (Q2422844) (← links)
- Around Borsuk's hypothesis (Q2519261) (← links)
- On some extremal problems on \(r\)-graphs (Q2544168) (← links)
- Turan's theorem for \(k\)-graphs (Q2552511) (← links)
- Co-degree density of hypergraphs (Q2642025) (← links)
- Extremal problems for multigraphs (Q2668012) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- The Chromatic Number of Kneser Hypergraphs (Q3743337) (← links)
- Algorithmic Solution of Extremal Digraph Problems (Q3745867) (← links)
- Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers (Q4610452) (← links)
- An Irrational Lagrangian Density of a Single Hypergraph (Q5067428) (← links)
- Exchange Properties of Finite Set-Systems (Q5099106) (← links)
- Relative Turán Problems for Uniform Hypergraphs (Q5157384) (← links)
- Triple systems with no three triples spanning at most five points (Q5229522) (← links)
- GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS (Q5242395) (← links)
- (Q5384264) (← links)
- Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) (← links)
- (Q5869355) (← links)
- Weakly saturated hypergraphs and a conjecture of Tuza (Q5889737) (← links)
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs (Q5963658) (← 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 numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles (Q6081569) (← links)
- Lagrangian-perfect hypergraphs (Q6084663) (← links)
- On Turán numbers for disconnected hypergraphs (Q6111798) (← links)
- Uniform Turán density of cycles (Q6112889) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
- Lagrangian densities of linear forests and Turán numbers of their extensions (Q6185559) (← links)
- On asymptotic local Turán problems (Q6188079) (← links)
- On the limit of the positive \(\ell\)-degree Turán problem (Q6199184) (← links)