Extremal graphs for intersecting triangles
From MaRDI portal
Publication:1892852
DOI10.1006/JCTB.1995.1026zbMATH Open0822.05036OpenAlexW2020049876WikidataQ30049192 ScholiaQ30049192MaRDI QIDQ1892852FDOQ1892852
Authors: Zoltán Füredi, Ronald Gould, David S. Gunderson, P. Erdős 
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
Recommendations
Cited In (60)
- Turán number of the odd-ballooning of complete bipartite graphs
- The signless Laplacian spectral radius of graphs without intersecting odd cycles
- Spectral extremal graphs without intersecting triangles as a minor
- Turán-type problems on \([a, b]\)-factors of graphs, and beyond
- Maximal chordal subgraphs
- Extremal graphs for the odd prism
- Counting rainbow triangles in edge-colored graphs
- Extremal graphs for the suspension of edge-critical graphs
- On generalized Turán numbers of intersecting cliques
- The spectral radius of graphs with no odd wheels
- Extremal graphs for blow-ups of stars and paths
- Extremal generalized hexagons and triple intersection numbers
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
- Some exact results for generalized Turán problems
- Maxima of the \(Q\)-index: forbidden a Fan
- Spectral extremal graphs for intersecting cliques
- The spectral radius of graphs with no intersecting odd cycles
- Graphic sequences with a realization containing intersecting cliques
- Extremal graph for intersecting odd cycles
- Extremal graphs for odd wheels
- The Turán number for the edge blow-up of trees
- Generalized Turán results for edge blow-up of star forests
- Generalized Turán problems for double stars
- Turán number and decomposition number of intersecting odd cycles
- Turán number for odd‐ballooning of trees
- Title not available (Why is that?)
- Fans and bundles in the graph of pairwise sums and products
- Extremal graphs for the \(k\)-flower
- The signless Laplacian spectral radius of graphs with no intersecting triangles
- The Turán number for the edge blow-up of trees: the missing case
- Extremal graphs for intersecting cliques
- Extremal graphs of the \(p\)th power of paths
- The maximum spectral radius of graphs without friendship subgraphs
- Generalized Turán results for intersecting cliques
- Large joints in graphs
- Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star
- Spectral Turán problems for intersecting even cycles
- On a conjecture of spectral extremal problems
- Extremal \(H\)-free planar graphs
- Decompositions of graphs into fans and single edges
- Extremal graphs for blow-ups of keyrings
- The Turán number of the square of a path
- A complete solution to the Cvetković–Rowlinson conjecture
- On tight components and anti-tight components
- Generalized Turán numbers for the edge blow-up of a graph
- Spectral extremal graphs for the bowtie
- tK\(_p\)-saturated graphs of minimum size
- On fan-saturated graphs
- A unique characterization of spectral extrema for friendship graphs
- Extremal graphs for odd-ballooning of paths and cycles
- Planar Turán number of intersecting triangles
- How connectivity affects the extremal number of trees
- Spectral extremal graphs for disjoint cliques
- Core-satellite graphs: clustering, assortativity and spectral properties
- A note on a Turán-type extremal question on 3-graphs
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
- Counting substructures and eigenvalues. I: Triangles
- Extremal graphs for edge blow-up of graphs
- The maximum number of triangles in \(F_k\)-free graphs
- The unique spectral extremal graph for intersecting cliques or intersecting odd cycles
This page was built for publication: Extremal graphs for intersecting triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892852)
