Extremal graphs for intersecting triangles

DOI10.1006/JCTB.1995.1026zbMath0822.05036OpenAlexW2020049876WikidataQ30049192 ScholiaQ30049192MaRDI QIDQ1892852

David S. Gundersson, Ronald J. Gould, Zoltan Fueredi

Publication date: 4 July 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1995.1026

zbMATH Keywords

extremal graphsfanintersecting triangles3-cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (44)

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 ⋮ Some exact results for generalized Turán problems ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ Extremal graphs of the \(p\)th power of paths ⋮ Extremal graphs for blow-ups of keyrings ⋮ A unique characterization of spectral extrema for friendship graphs ⋮ Extremal graphs for odd-ballooning of paths and cycles ⋮ Extremal graphs for edge blow-up of graphs ⋮ Large joints in graphs ⋮ Turán number and decomposition number of intersecting odd cycles ⋮ Extremal \(H\)-free planar graphs ⋮ Generalized Turán problems for double stars ⋮ Generalized Turán results for intersecting cliques ⋮ The maximum number of triangles in \(F_k\)-free graphs ⋮ 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 ⋮ A complete solution to the Cvetković–Rowlinson conjecture ⋮ On a conjecture of spectral extremal problems ⋮ Turán number for odd‐ballooning of trees ⋮ On tight components and anti-tight components ⋮ The unique spectral extremal graph for intersecting cliques or intersecting odd cycles ⋮ Spectral extremal graphs for disjoint cliques ⋮ Spectral Turán problems for intersecting even cycles ⋮ On fan-saturated graphs ⋮ The Turán number for the edge blow-up of trees: the missing case ⋮ Counting substructures and eigenvalues. I: Triangles ⋮ The maximum spectral radius of graphs without friendship subgraphs ⋮ Extremal graphs for intersecting cliques ⋮ The Turán number for the edge blow-up of trees ⋮ The spectral radius of graphs with no odd wheels ⋮ Core-satellite graphs: clustering, assortativity and spectral properties ⋮ On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic ⋮ The signless Laplacian spectral radius of graphs with no intersecting triangles ⋮ Supersaturation problem for the bowtie ⋮ The Turán number of the square of a path ⋮ tK\(_p\)-saturated graphs of minimum size ⋮ Maxima of the \(Q\)-index: forbidden a Fan ⋮ Planar Turán number of intersecting triangles ⋮ Decompositions of Graphs into Fans and Single Edges

This page was built for publication: Extremal graphs for intersecting triangles