The largest hole in sparse random graphs

DOI10.1007/978-3-030-83823-2_8MaRDI QIDQ6604671

Nemanja Draganić, Michael Krivelevich, Stefan Glock

Publication date: 13 September 2024

zbMATH Keywords

holerandom graphsecond moment methodinduced path

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Trees in random graphs
• On the independence number of random graphs
• Induced trees in sparse random graphs
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• Large holes in sparse random graphs
• Maximal induces trees in sparse random graphs
• On large induced trees and long induced paths in sparse random graphs
• The size of the largest hole in a random graph
• Large induced trees in sparse random graphs
• The phase transition in random graphs: a simple proof
• Independent Sets in Random Graphs from the Weighted Second Moment Method
• On colouring random graphs
• Cliques in random graphs
• On Induced Paths, Holes and Trees in Random Graphs
• Large Induced Matchings in Random Graphs
• The chromatic number of random graphs

This page was built for publication: The largest hole in sparse random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604671)