Pages that link to "Item:Q1180425"
From MaRDI portal
The following pages link to On the number of edge disjoint cliques in graphs of given size (Q1180425):
Displaying 21 items.
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity (Q490983) (← links)
- Large joints in graphs (Q607362) (← links)
- Disjoint cliques and disjoint maximal independent sets of vertices in graphs (Q1168336) (← links)
- Extremal graphs for intersecting cliques (Q1417960) (← links)
- Stability results for graphs with a critical edge (Q1671746) (← links)
- A new Turán-type theorem for cliques in graphs (Q1827735) (← links)
- Packing triangles in \(K_4\)-free graphs (Q2014715) (← links)
- Extremal graphs for two vertex-disjoint copies of a clique (Q2117533) (← links)
- Spectral radius, edge-disjoint cycles and cycles of the same length (Q2138553) (← links)
- Many cliques with few edges (Q2223482) (← links)
- Edge-Disjoint Cliques in Graphs with High Minimum Degree (Q3192169) (← links)
- Monochromatic Clique Decompositions of Graphs (Q3466344) (← links)
- (Q3804726) (← links)
- On the Structure of Edge Graphs (Q4401980) (← links)
- Sharp bounds for decomposing graphs into edges and triangles (Q4993262) (← links)
- Stability Results for Two Classes of Hypergraphs (Q5238747) (← links)
- An upper bound on the number of cliques in a graph (Q5287454) (← links)
- Monochromatic <i>K<sub>r</sub></i>‐Decompositions of Graphs (Q5418770) (← links)
- On the number of edge-disjoint triangles in \(K_4\)-free graphs (Q5915816) (← links)
- Minimum rainbow \(H\)-decompositions of graphs (Q5916053) (← links)
- On the number of edge-disjoint triangles in \(K_4\)-free graphs (Q5970289) (← links)
