Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree
type: Item
instance of: scholarly article
title: Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree
zbMATH Open document ID: 1047.05022
author: Deryk Osthus
author: Daniela Kühn
published in: Combinatorica
publication date: 2004-10-19T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05D40
zbMATH DE Number: 2108690
zbMATH Keywords: graph
zbMATH Keywords: average degree
MaRDI profile type: Publication
full work available at URL: s00493-004-0010-2
OpenAlex ID: W2042135415
DOI: 10.1007/S00493-004-0010-2
Recommended article: \(C_4\)-free subgraphs with large average degree
Recommended article: Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges
Recommended article: Decomposition of bounded degree graphs into \(C_4\)-free subgraphs
Recommended article: Large cliques in \(C_4\)-free graphs
Recommended article: Large P4‐free graphs with bounded degree
Recommended article: Cliques in \(C_4\)-free graphs of large minimum degree
Recommended article: On the maximum number of edges in a c4‐free subgraph of qn
Recommended article: A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
Recommended article: Almost all graphs with average degree 4 are 3-colorable
Recommended article: Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
description: scientific article; zbMATH DE number 2108690