Turán function and \(H\)-decomposition problem for gem graphs

DOI10.7151/dmgt.2046zbMath1392.05060OpenAlexW2790154290MaRDI QIDQ1649911

Teresa Sousa, Henry Liu

Publication date: 29 June 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2046

zbMATH Keywords

graph decompositionextremal graphTurán functiongem graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Minimum \(H\)-decompositions of graphs: edge-critical case
• An improved error term for minimum \(H\)-decompositions of graphs
• Path Ramsey numbers in multicolorings
• Minimum \(H\)-decompositions of graphs
• Decompositions of graphs into 5-cycles and other small graphs
• A note on the Turán function of even cycles
• On complete subgraphs of different orders
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Decompositions of Graphs into Fans and Single Edges
• The Representation of a Graph by Set Intersections
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Turán function and \(H\)-decomposition problem for gem graphs