Extremal graphs for intersecting cliques
From MaRDI portal
Publication:1417960
DOI10.1016/S0095-8956(03)00044-3zbMath1031.05069OpenAlexW1991403353MaRDI QIDQ1417960
Guantao Chen, Bing Wei, Ronald J. Gould, Florian Pfender
Publication date: 6 January 2004
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0095-8956(03)00044-3
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (29)
Graphic sequences with a realization containing intersecting cliques ⋮ Spectral extremal graphs for intersecting cliques ⋮ Extremal graphs for blow-ups of stars and paths ⋮ Extremal graph for intersecting odd cycles ⋮ Extremal graphs of the \(p\)th power of paths ⋮ Extremal graphs for blow-ups of keyrings ⋮ Extremal graphs for odd-ballooning of paths and cycles ⋮ Extremal graphs for edge blow-up of graphs ⋮ Turán number and decomposition number of intersecting odd cycles ⋮ Extremal \(H\)-free planar graphs ⋮ Generalized Turán results for intersecting cliques ⋮ Spectral extremal graphs for the bowtie ⋮ Extremal graphs for odd wheels ⋮ Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star ⋮ Generalized Turán numbers for the edge blow-up of a graph ⋮ On a conjecture of spectral extremal problems ⋮ Turán number for odd‐ballooning of trees ⋮ Some exact results for non-degenerate generalized Turán problems ⋮ The unique spectral extremal graph for intersecting cliques or intersecting odd cycles ⋮ Spectral extremal graphs for disjoint cliques ⋮ Decomposition of Graphs into (k,r)‐Fans and Single Edges ⋮ The Turán number for the edge blow-up of trees: the missing case ⋮ The Turán number for the edge blow-up of trees ⋮ Core-satellite graphs: clustering, assortativity and spectral properties ⋮ On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic ⋮ Graphic sequences with a realization containing a generalized friendship graph ⋮ Turán problems for Berge-\((k, p)\)-fan hypergraph ⋮ tK\(_p\)-saturated graphs of minimum size ⋮ Planar Turán number of intersecting triangles
Cites Work
This page was built for publication: Extremal graphs for intersecting cliques
