Turán numbers for disjoint copies of graphs

DOI10.1007/S00373-010-0999-5zbMATH Open1234.05129OpenAlexW2023913113MaRDI QIDQ659740FDOQ659740

Izolda Gorgol

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0999-5

Recommendations

• The Turán number of disjoint copies of paths
• Generalized Turán problems for disjoint copies of graphs
• Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs
• On generalized Turán number of two disjoint cliques
• Turán numbers for disjoint paths

zbMATH Keywords

extremal graphdisjoint copiesTurán number

Mathematics Subject Classification ID

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

Cites Work

• On maximal paths and circuits of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Turán number for the hexagon
• Title not available (Why is that?)
• Arc coverings of graphs
• On two Turán Numbers

Cited In (36)

• Saturation numbers for \(t P_k\) with \(k\) less than 6
• The Turán number of star forests
• The Turán numbers of special forests
• An \(A_\alpha\)-spectral Erdős-Pósa theorem
• The Turàn number of the graph 3P4
• Forbidding multiple copies of forestable graphs
• Title not available (Why is that?)
• A note on the Turán number of an arbitrary star forest
• The Turán number of \(k \cdot S_\ell \)
• Some new results on the Turán number of star forests
• On Turán number for \(S_{\ell_1} \cup S_{\ell_2}\)
• Hypergraph Turán numbers of vertex disjoint cycles
• On the Turán number of forests
• The Turán number for \(4 \cdot S_{\ell}^1\)
• The lower and upper bounds of Turán number for odd wheels
• The formula for Turán number of spanning linear forests
• Two results about the Turán number of star forests
• Generalized Turán problems for disjoint copies of graphs
• Hypergraphs Not Containing a Tight Tree with a Bounded Trunk
• The Turán number of the graph \(2P_5\)
• A proof for a conjecture of Gorgol
• A proof for a conjecture of Gorgol
• On the Turán numbers of linear forests in bipartite graphs
• The bipartite Turán number and spectral extremum for linear forests
• On extremal hypergraphs for forests of tight paths
• The complete value of the Turán number of \(3K_{p+1}\)
• Turán Numbers of Multiple Paths and Equibipartite Forests
• Turán number of two vertex-disjoint copies of cliques.
• The Turán number of disjoint copies of paths
• Turán numbers for disjoint paths
• Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3
• Title not available (Why is that?)
• A note on the Turán number of disjoint union of wheels
• Maximum cliques in a graph without disjoint given subgraph
• Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs
• Degree powers in graphs with a forbidden forest

This page was built for publication: Turán numbers for disjoint copies of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659740)