Can we create large \(k\)-cores by adding few edges?
type: Item
instance of: scholarly article
title: Can we create large \(k\)-cores by adding few edges?
zbMATH Open document ID: 1485.68177
DOI: 10.1007/978-3-319-90530-3_8
author: Rajesh Chitnis
author: Nimrod Talmon
publication date: 2018-11-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6986109
MaRDI profile type: Publication
full work available at URL: 978-3-319-90530-3 8
OpenAlex ID: W2802741730
Recommended article: Q5089202
Recommended article: Building large \(k\)-cores from sparse graphs
Recommended article: Do 3n − 5 edges force a subdivision ofK5?
Recommended article: Q4657591
Recommended article: On the maximum number of unit edges in \(K_{m,n}\)
Recommended article: On the maximum size of a minimal \(k\)-edge connected augmentation
Recommended article: Edges in graphs with large girth
Recommended article: Graph-Theoretic Concepts in Computer Science
Recommended article: Q4488555
Recommended article: Maximum number of edges in a critically \(k\)-connected graph
description: scientific article; zbMATH DE number 6986109