Publication:5900071: Difference between revisions
From MaRDI portal
Publication:5900071
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page The order of the largest complete minor in a random graph to The order of the largest complete minor in a random graph: Duplicate |
(No difference)
| |
Latest revision as of 16:02, 2 May 2024
DOI10.1016/j.endm.2007.07.023zbMath1341.05228arXiv0705.0325MaRDI QIDQ5900071
Daniela Kühn, Deryk Osthus, Nikolaos Fountoulakis
Publication date: 5 June 2008
Published in: Electronic Notes in Discrete Mathematics, Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0705.0325
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topological cliques of random graphs
- Lower bound of the Hadwiger number of graphs by their average degree
- Minors in expanding graphs
- Hadwiger's conjecture is true for almost every graph
- The longest path in a random graph
- On the conjecture of Hajos
- The extremal function for complete minors
- An extremal function for contractions of graphs
- The Structure of a Random Graph at the Point of the Phase Transition
