The following pages link to Flag algebras (Q5444699):
Displaying 50 items.
- On the algebraic and topological structure of the set of Turán densities (Q256996) (← links)
- A problem of Erdős and Sós on 3-graphs (Q273102) (← links)
- Embedding tetrahedra into quasirandom hypergraphs (Q326814) (← links)
- The clique density theorem (Q338418) (← links)
- Mini-workshop: Hypergraph Turán problem. Abstracts from the mini-workshop held April 8--14, 2012. (Q343331) (← links)
- Note on upper density of quasi-random hypergraphs (Q396781) (← links)
- A new lower bound based on Gromov's method of selecting heavily covered points (Q452003) (← links)
- The inducibility of blow-up graphs (Q462932) (← links)
- Monochromatic triangles in three-coloured graphs (Q463289) (← links)
- On possible Turán densities (Q466081) (← links)
- Finitely forcible graphons and permutons (Q473103) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
- A note on the inducibility of 4-vertex graphs (Q497330) (← links)
- Flag algebras and the stable coefficients of the Jones polynomial (Q499459) (← links)
- On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament (Q528999) (← links)
- The homomorphism domination exponent (Q648968) (← links)
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971) (← links)
- An analytic approach to stability (Q710597) (← links)
- On the maximum number of five-cycles in a triangle-free graph (Q713972) (← links)
- A problem of Erdős on the minimum number of \(k\)-cliques (Q744160) (← links)
- Inducibility of directed paths (Q785814) (← links)
- On the maximum diameter of \(k\)-colorable graphs (Q820842) (← links)
- An exact Turán result for tripartite 3-graphs (Q888608) (← links)
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle (Q896063) (← links)
- A bound on the inducibility of cycles (Q1621427) (← links)
- Finitely forcible graph limits are universal (Q1621473) (← links)
- Symmetry in Turán sums of squares polynomials from flag algebras (Q1637376) (← links)
- Pentagons in triangle-free graphs (Q1671749) (← links)
- The codegree threshold of \(K_4^-\) (Q1689950) (← links)
- Extremal graph theory and finite forcibility (Q1689971) (← links)
- The minimum number of triangles in graphs of given order and size (Q1690017) (← links)
- Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
- Strong forms of stability from flag algebra calculations (Q1719577) (← links)
- On the maximum density of fixed strongly connected subtournaments (Q1733920) (← links)
- The feasible region of hypergraphs (Q1998756) (← links)
- Packing triangles in \(K_4\)-free graphs (Q2014715) (← links)
- Maximizing five-cycles in \(K_r\)-free graphs (Q2048348) (← links)
- An improved lower bound for multicolor Ramsey numbers and a problem of Erdős (Q2077262) (← links)
- Paths of length three are \(K_{r+1}\)-Turán-good (Q2121716) (← links)
- An extremal problem motivated by triangle-free strongly regular graphs (Q2131859) (← links)
- On the inducibility of oriented graphs on four vertices (Q2138968) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Maximum number of almost similar triangles in the plane (Q2144458) (← links)
- Non-bipartite \(k\)-common graphs (Q2151175) (← links)
- On the local structure of oriented graphs -- a case study in flag algebras (Q2170792) (← links)
- Extremal problems in uniformly dense hypergraphs (Q2189833) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Simple graph density inequalities with no sum of squares proofs (Q2221001) (← links)
- Tilings in graphons (Q2225467) (← links)
- Finitely forcible graphons (Q2275893) (← links)
