2023/07/01 by Matías Pavez‐Signé, Pavez-Signé, Matías
Computer Science · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2307.00322
openalex publication_date 2023/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
We show that for every Δ∈\mathbb N, there exists a constant C such that if G is an (n,d,λ)-graph with d/λ≥ C and d is large enough, then G2 contains every n-vertex tree with maximum degree bounded by Δ. This answers a question of Krivelevich.