scientific article; zbMATH DE number 5764887

MaRDI QIDQ3579480zbMATH OpenFDO

Authors Noga Alon, Michael Capalbo

Publication date 6 August 2010

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited in

(12)

• The size‐Ramsey number of cubic graphs
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• Adjacency labeling schemes and induced-universal graphs
• Sparse partition universal graphs for graphs of bounded degree
• On universal hypergraphs
• Almost-spanning universality in random graphs (extended abstract)
• Universal and unavoidable graphs
• Optimal threshold for a random graph to be 2-universal
• Finding any given 2‐factor in sparse pseudorandom graphs efficiently
• Universal geometric graphs
• Optimal induced universal graphs for bounded-degree graphs
• Poisson approximation for non-backtracking random walks

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 Q3579480)