A simple solution to the k‐core problem
type: Item
instance of: scholarly article
title: A simple solution to the k‐core problem
zbMATH Open document ID: 1113.05091
author: Svante Janson
author: Malwina Luczak
publication date: 2007-02-07T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/0508453
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 60F15
Mathematics Subject Classification ID: 60J80
zbMATH DE Number: 5122850
zbMATH Keywords: Cores of random graphs
zbMATH Keywords: death processes
zbMATH Keywords: empirical distributions
zbMATH Keywords: law of large numbers
MaRDI profile type: Publication
OpenAlex ID: W2330524492
arXiv ID: math/0508453
cites work: Q4419475
cites work: The Probability That a Random Multigraph is Simple
cites work: Q2774021
cites work: Poisson Cloning Model for Random Graphs
DOI: 10.1002/RSA.20147
Recommended article: Minimum k‐cores and the k‐core polytope
Recommended article: The k-Separator Problem
Recommended article: The \(k\)-partitioning problem
Recommended article: Q5365030
Recommended article: The $k$ -Equal Problem
Recommended article: The minimal \(k\)-core problem for modeling \(k\)-assemblies
Recommended article: A Linear Time Algorithm for Finding ak-Tree Core
Recommended article: Q4367329
Recommended article: The \(k\)-cardinality assignment problem
Recommended article: Q5009469
published in: Random Structures \& Algorithms
description: scientific article