Turán function and \(H\)-decomposition problem for gem graphs
type: Item
instance of: scholarly article
title: Turán function and \(H\)-decomposition problem for gem graphs
zbMATH Open document ID: 1392.05060
author: Henry Liu
author: Teresa Sousa
publication date: 2018-06-29T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6897678
zbMATH Keywords: gem graph
zbMATH Keywords: Turán function
zbMATH Keywords: extremal graph
zbMATH Keywords: graph decomposition
MaRDI profile type: Publication
full work available at URL: dmgt.2046
OpenAlex ID: W2790154290
cites work: An improved error term for minimum \(H\)-decompositions of graphs
cites work: On complete subgraphs of different orders
cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
cites work: The Representation of a Graph by Set Intersections
cites work: Path Ramsey numbers in multicolorings
cites work: Decompositions of Graphs into Fans and Single Edges
cites work: Minimum \(H\)-decompositions of graphs: edge-critical case
cites work: A note on the Turán function of even cycles
cites work: Minimum \(H\)-decompositions of graphs
cites work: Decompositions of graphs into 5-cycles and other small graphs
cites work: Q3166469
cites work: Decomposition of graphs into cycles of length seven and single edges.
cites work: Q5781249
DOI: 10.7151/DMGT.2046
published in: Discussiones Mathematicae Graph Theory
Recommended article: Decomposition of directed graphs and the Turán problem
Recommended article: Q4949874
Recommended article: Q3385121
Recommended article: Generalized Turán problems for complete bipartite graphs
Recommended article: Q3666882
Recommended article: Q5512796
Recommended article: Multipartite Turán problem for connected graphs and hypergraphs
Recommended article: Q3089368
Recommended article: Generalized Turán problems for disjoint copies of graphs
Recommended article: Turán problems on non-uniform hypergraphs
description: scientific article; zbMATH DE number 6897678