Almost all trees are almost graceful

DOI10.1002/rsa.20906zbMath1456.05134arXiv1608.01577OpenAlexW2502187594MaRDI QIDQ5128748

No author found.

Publication date: 26 October 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.01577

zbMATH Keywords

treeextremal graph theorygraceful tree labelling

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (8)

Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Graph and hypergraph packing ⋮ Embedding rainbow trees with applications to graph labelling and decomposition ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ A proof of Ringel's conjecture ⋮ Optimal packings of bounded degree trees ⋮ Packing degenerate graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximate version of the tree packing conjecture
• Packing minor-closed families of graphs into complete graphs
• Operations of interlaced trees and graceful trees
• Differential equations for random processes and random graphs
• Optimal packings of bounded degree trees
• Packing degenerate graphs
• On the maximum degree in a random tree
• Packing spanning graphs from separable families
• On Additive Bases and Harmonious Graphs
• A blow-up lemma for approximate decompositions
• Packing trees of unbounded degrees in random graphs
• Infinitely many equivalent versions of the graceful tree conjecture
• Probability Inequalities for Sums of Bounded Random Variables
• Relaxed graceful labellings of trees

This page was built for publication: Almost all trees are almost graceful