Back to Search Start Over

Almost-spanning universality in random graphs.

Authors :
Conlon, David
Ferber, Asaf
Nenadov, Rajko
Škorić, Nemanja
Source :
Random Structures & Algorithms; May2017, Vol. 50 Issue 3, p380-393, 14p
Publication Year :
2017

Abstract

A graph G is said to be [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
10429832
Volume :
50
Issue :
3
Database :
Complementary Index
Journal :
Random Structures & Algorithms
Publication Type :
Academic Journal
Accession number :
122015537
Full Text :
https://doi.org/10.1002/rsa.20661