scientific article; zbMATH DE number 1833411
zbMATH Open1001.05086MaRDI QIDQ4780792FDOQ4780792
Authors: Noga Alon, Michael Capalbo, Yoshiharu Kohayakawa, Vojtěch Rödl, Andrzej Ruciński, Endre Szemerédi 
Publication date: 21 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2129/21290170
Title of this publication is not available (Why is that?)
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cited In (18)
- Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
- On finite superuniversal graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Sparse partition universal graphs for graphs of bounded degree
- Almost universal graphs
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
- On universal hypergraphs
- Almost-spanning universality in random graphs (extended abstract)
- Sparse universal graphs for bounded‐degree graphs
- Small universal graphs
- Finding any given 2‐factor in sparse pseudorandom graphs efficiently
- Optimal threshold for a random graph to be 2-universal
- Sparse universal graphs
- Optimal induced universal graphs for bounded-degree graphs
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
- Explicit sparse almost-universal graphs for \(\mathcal G (n, \frac kn)\)
- Optimal induced universal graphs for bounded-degree graphs
- Induced-universal graphs for graphs with bounded maximum degree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780792)
