Dismantling Sparse Random Graphs (Q3512603): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 12:30, 28 June 2024

scientific article

Language	Label	Description	Also known as
English	Dismantling Sparse Random Graphs	scientific article

Statements

scholarly article

0 references

Dismantling Sparse Random Graphs (English)

0 references

0 references

Andrew G. Thomason

0 references

Combinatorics, Probability and Computing

0 references

publication date

21 July 2008

0 references

full work available at URL

https://arxiv.org/abs/0709.1787

0 references

zbMATH Keywords

random graph

0 references

sparse random graph

0 references

fragmentation

0 references

vaccination

0 references

MaRDI profile type

MaRDI publication profile

0 references

On the independence number of random graphs

0 references

Concentration of measure and isoperimetric inequalities in product spaces

0 references

Concentration for Independent Permutations

0 references

A Separator Theorem for Planar Graphs

0 references

Fragmentability of graphs

0 references

The phase transition in inhomogeneous random graphs

0 references

A simple solution to the <i>k</i>‐core problem

0 references

Decycling numbers of random regular graphs

0 references

Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method

0 references

On the independence and chromatic numbers of random regular graphs

0 references

New upper bounds on harmonious colorings

0 references

Identifiers

zbMATH Open document ID

0 references

10.1017/S0963548307008802

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3512603

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3512603&oldid=35064002"