Decomposition of Graphs into (k,r)‐Fans and Single Edges

DOI10.1002/jgt.22139zbMath1380.05161arXiv1510.00811OpenAlexW2964080531MaRDI QIDQ4604014

Yu Qiu, Boyuan Liu, Xin Min Hou

Publication date: 23 February 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.00811

zbMATH Keywords

decompositionsextremal graphfans

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

\(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges ⋮ Decomposing uniform hypergraphs into uniform hypertrees and single edges

Cites Work

• 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
• Minimum \(H\)-decompositions of graphs
• Decompositions of graphs into 5-cycles and other small graphs
• On complete subgraphs of different orders
• Decompositions of Graphs into Fans and Single Edges
• The Representation of a Graph by Set Intersections
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition of Graphs into (k,r)‐Fans and Single Edges