Generalized Turán number for linear forests
From MaRDI portal
Publication:2144592
DOI10.1016/J.DISC.2022.112997zbMath1491.05107arXiv2109.01809OpenAlexW4281562631WikidataQ114190510 ScholiaQ114190510MaRDI QIDQ2144592
Publication date: 14 June 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.01809
Related Items (3)
The maximum number of triangles in \(F_k\)-free graphs ⋮ Maximum cliques in a graph without disjoint given subgraph ⋮ On the \(A_\alpha\)-spectral radius of graphs without linear forests
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Turán number of forests
- On the maximum number of five-cycles in a triangle-free graph
- Pentagons vs. triangles
- The maximum number of cliques in graphs without long cycles
- Erdős-Gallai stability theorem for linear forests
- On the number of pentagons in triangle-free graphs
- Some sharp results on the generalized Turán numbers
- Generalized Turán number of even linear forests
- Generalized Turán problems for even cycles
- The shifting method and generalized Turán number of matchings
- Generalized Turán problems for disjoint copies of graphs
- A note on Hamiltonian circuits
- Turán Numbers of Multiple Paths and Equibipartite Forests
- On maximal paths and circuits of graphs
- Long paths, long cycles, and their relative length
- [https://portal.mardi4nfdi.de/wiki/Publication:4242796 An El-Zah�r type condition ensuring path-factors]
- The maximum number of triangles in a graph of given maximum degree
- Extensions of the Erdős–Gallai theorem and Luo’s theorem
- Some Theorems on Abstract Graphs
- On the structure of linear graphs
- Many \(T\) copies in \(H\)-free graphs
- Turán numbers for disjoint paths
This page was built for publication: Generalized Turán number for linear forests
