On the number of edges not covered by monochromatic copies of a fixed graph.
type: Item
instance of: scholarly article
title: On the number of edges not covered by monochromatic copies of a fixed graph.
zbMATH Open document ID: 1033.05042
DOI: 10.1016/S0095-8956(03)00075-3
author: Peter Keevash
author: Benny Sudakov
published in: Journal of Combinatorial Theory. Series B
publication date: 2004-03-15T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 2057683
zbMATH Keywords: Turán number
zbMATH Keywords: edge-color-critical graph
MaRDI profile type: Publication
cites work: Q4398864
cites work: Some recent problems and results in graph theory
cites work: Edge disjoint monochromatic triangles in 2-colored graphs
cites work: On the structure of linear graphs
cites work: On Sets of Acquaintances and Strangers at any Party
cites work: Q3997075
cites work: Packing triangles in a graph and its complement
cites work: Q4276003
cites work: Clique covering of graphs
cites work: Q5548826
cites work: Graph products and monochromatic multiplicities
Recommended article: Q4984778
Recommended article: On edges not in monochromatic copies of a fixed bipartite graph
Recommended article: Edges not in any monochromatic copy of a fixed graph
Recommended article: On the number of irreducible covers of a graph by edges
Recommended article: Q5354867
Recommended article: Edges Not Covered by Monochromatic Bipartite Graph
Recommended article: Edge fixed monophonic number of a graph
Recommended article: The edge fixing edge-to-vertex monophonic number of a graph
Recommended article: THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
Recommended article: On the number of edges in some graphs
description: scientific article; zbMATH DE number 2057683