Holes in random graphs (Q1174180)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Holes in random graphs	scientific article

Statements

scholarly article

0 references

Holes in random graphs (English)

0 references

zbMATH Open document ID

0 references

10.1016/0166-218X(91)90045-X

0 references

0 references

Discrete Applied Mathematics

0 references

publication date

25 June 1992

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

holes

0 references

random graph

0 references

cycles

0 references

MaRDI profile type

MaRDI publication profile

0 references

The number of matchings in random regular graphs and bipartite graphs

0 references

The chromatic number of random graphs

0 references

0 references

The size of the largest hole in a random graph

0 references

The chromatic number of random graphs at the double-jump threshold

0 references

Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1174180

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