Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Infinite paths and cliques in random graphs

From MaRDI portal
Publication:3112380
Jump to:navigation, search

DOI10.4064/fm216-2-6zbMath1243.05216arXiv0809.2335OpenAlexW2962901284MaRDI QIDQ3112380

Alessandro Berarducci, Pietro Majer, Matteo Novaga

Publication date: 13 January 2012

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.2335


zbMATH Keywords

probabilityrandom graphsRamsey theorypercolation threshold


Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorics of partially ordered sets (06A07) Combinatorial probability (60C05) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)








This page was built for publication: Infinite paths and cliques in random graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3112380&oldid=16192067"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki