scientific article; zbMATH DE number 7053374
From MaRDI portal
Publication:5743497
zbMath1423.05087MaRDI QIDQ5743497
Michael Krivelevich, Wojciech Samotij, Daniel Johannsen
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095238
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Cites Work
- A randomized embedding algorithm for trees
- Hamilton cycles in highly connected and expanding graphs
- Embedding nearly-spanning bounded degree trees
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Expanding graphs contain all small trees
- Trees in sparse random graphs
- The longest path in a random graph
- On graphs which contain all small trees
- Sparse universal graphs
- Hamilton cycles in random subgraphs of pseudo-random graphs
- Large bounded degree trees in expanding graphs
- On the maximum degree in a random tree
- Tree embeddings
- Random regular graphs of high degree
- Spanning Trees in Dense Graphs
- Small universal graphs
- Embedding Spanning Trees in Random Graphs
- Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$
- Local resilience of almost spanning trees in random graphs
- Sharp threshold for the appearance of certain spanning trees in random graphs
- Maximal Flow Through a Network
- Uniform generation of random regular graphs of moderate degree
- Remarks on positional games. I
- Random Trees in Random Graphs
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
- On Graphs Which Contain All Sparse Graphs
- On Universal Graphs for Spanning Trees
- Sparse pseudo‐random graphs are Hamiltonian
- An Extension of the Blow-up Lemma to Arrangeable Graphs
- Combinatorial Games
- Sparse universal graphs for bounded‐degree graphs
- Almost universal graphs
- On a combinatorial game
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
