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

DOI10.7151/DMGT.2046MaRDI QIDQ1649911zbMATH OpenOpenAlexFDO

Authors Henry Liu, Teresa Sousa

Publication date 29 June 2018

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

graph decompositionextremal graphgem graphTurán function

Mathematics Subject Classification ID

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

Recommendations

• Decomposition of directed graphs and the Turán problem
• scientific article; zbMATH DE number 1439495
• The Turan number of graphs with given decomposition family
• Generalized Turán problems for complete bipartite graphs
• scientific article; zbMATH DE number 3819765
• scientific article; zbMATH DE number 3224335
• Multipartite Turán problem for connected graphs and hypergraphs
• scientific article; zbMATH DE number 5942358
• Generalized Turán problems for disjoint copies of graphs
• Turán problems on non-uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 6093217 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• A note on the Turán function of even cycles
• An improved error term for minimum H-decompositions of graphs
• Decomposition of graphs into cycles of length seven and single edges.
• Decompositions of graphs into 5-cycles and other small graphs
• Decompositions of graphs into fans and single edges
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Minimum \(H\)-decompositions of graphs
• Minimum \(H\)-decompositions of graphs: edge-critical case
• On complete subgraphs of different orders
• Path Ramsey numbers in multicolorings
• The Representation of a Graph by Set Intersections

Cited in

(2)

• Turán number and decomposition number of intersecting odd cycles
• Decompositions of graphs into fans and single edges

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

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