Pages that link to "Item:Q1827735"
From MaRDI portal
The following pages link to A new Turán-type theorem for cliques in graphs (Q1827735):
Displaying 24 items.
- Cliques in graphs excluding a complete graph minor (Q311514) (← links)
- Independent sets in graphs (Q501998) (← links)
- Face vectors of flag complexes (Q940742) (← links)
- A Kruskal-Katona type theorem for graphs (Q966066) (← links)
- On the maximum number of cliques in a graph (Q995772) (← links)
- Turán's theorem inverted (Q1045153) (← links)
- Another extremal problem for Turan graphs (Q1093651) (← links)
- Bounds on the number of complete subgraphs (Q1195482) (← links)
- Extension of Turán's theorem to the 2-stability number (Q1865136) (← links)
- Some sharp results on the generalized Turán numbers (Q2011146) (← links)
- Flag complexes and homology (Q2037172) (← links)
- Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number (Q2174573) (← links)
- The ``quantum'' Turán problem for operator systems (Q2305335) (← links)
- Many triangles with few edges (Q2420564) (← links)
- Convex hull of face vectors of colored complexes (Q2441631) (← links)
- Joints in graphs (Q2463464) (← links)
- A new proof of the Fisher-Ryan bounds for the number of cliques of a graph (Q2716676) (← links)
- The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs (Q4644780) (← links)
- (Q4810363) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- A generalization of a Turán’s theorem about maximum clique on graphs (Q5054044) (← links)
- (Q5135778) (← links)
- On the densities of cliques and independent sets in graphs (Q5915866) (← links)
- Localised graph Maclaurin inequalities (Q6621959) (← links)
