scientific article; zbMATH DE number 1833411
From MaRDI portal
Publication:4780792
zbMath1001.05086MaRDI QIDQ4780792
Yoshiharu Kohayakawa, Noga Alon, Michael Capalbo, Endre Szemerédi, Vojtěch Rödl, Andrzej Ruciński
Publication date: 21 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2129/21290170
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Induced-universal graphs for graphs with bounded maximum degree, Almost-spanning universality in random graphs (extended abstract), Finding any given 2‐factor in sparse pseudorandom graphs efficiently, Sparse partition universal graphs for graphs of bounded degree, Optimal induced universal graphs for bounded-degree graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Sparse universal graphs for bounded‐degree graphs, On universal hypergraphs, Almost universal graphs, Optimal threshold for a random graph to be 2-universal
