Turán number and decomposition number of intersecting odd cycles
From MaRDI portal
Publication:2411603
DOI10.1016/j.disc.2017.08.021zbMath1372.05171arXiv1610.00815OpenAlexW2529102419WikidataQ114190706 ScholiaQ114190706MaRDI QIDQ2411603
Yu Qiu, Xin Min Hou, Boyuan Liu
Publication date: 24 October 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.00815
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (10)
The spectral radius of graphs with no intersecting odd cycles ⋮ Extremal graphs for blow-ups of keyrings ⋮ Extremal graphs for odd-ballooning of paths and cycles ⋮ Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star ⋮ Turán number for odd‐ballooning of trees ⋮ The unique spectral extremal graph for intersecting cliques or intersecting odd cycles ⋮ Spectral Turán problems for intersecting even cycles ⋮ \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges ⋮ The Turán number for the edge blow-up of trees ⋮ Decomposing uniform hypergraphs into uniform hypertrees and single edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal graph for intersecting odd cycles
- Minimum \(H\)-decompositions of graphs: edge-critical case
- An improved error term for minimum \(H\)-decompositions of graphs
- Degrees and matchings
- Extremal graphs for intersecting cliques
- Extremal graphs for intersecting triangles
- Extremal graphs for blow-ups of cycles and trees
- Minimum \(H\)-decompositions of graphs
- Decompositions of graphs into 5-cycles and other small graphs
- On complete subgraphs of different orders
- The Representation of a Graph by Set Intersections
This page was built for publication: Turán number and decomposition number of intersecting odd cycles
