Image de couverture de livre

On the class reconstruction number of trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Krasikov, Ilia, Roditty, Yehuda, Thatte, Bhalchandra D.
Format:	Preprint
Publié:	2023
Sujets:	Combinatorics 05C60
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the reconstruction of trees from their chromatic symmetric functions
par: Gonzalez, Michael, et autres
Publié: (2025)

Fringe trees of Patricia tries, compressed binary search trees, and three other random full binary trees
par: Janson, Svante
Publié: (2024)

The largest common subtree of two random trees
par: Angel, Omer, et autres
Publié: (2025)

The $(\leq 6)$-half-reconstructibility of digraphs
par: Salem, Baraa, et autres
Publié: (2013)

Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees
par: Brandenberger, Anna, et autres
Publié: (2025)

Critical trees are neither too short nor too fat
par: Addario-Berry, Louigi, et autres
Publié: (2023)

Tight universal bounds on the height times the width of random trees
par: Donderwinkel, Serte, et autres
Publié: (2024)

Paired domination in trees: A linear algorithm and asymptotic normality
par: Henning, Michael A., et autres
Publié: (2025)

Thresholds for patterns in random permutations with a given number of inversions
par: Bevan, David, et autres
Publié: (2023)

Chromatic symmetric functions and polynomial invariants of trees
par: Aliste-Prieto, José, et autres
Publié: (2024)

Limits of chordal graphs with bounded tree-width
par: Castellví, Jordi, et autres
Publié: (2023)

Asymptotics for the number of bipartite graphs with fixed surplus
par: Clancy Jr, David
Publié: (2024)

Extreme local statistics in random graphs: maximum tree extension counts
par: Araújo, Pedro, et autres
Publié: (2023)

Binary search trees of permuton samples
par: Corsini, Benoît, et autres
Publié: (2024)

Caterpillars with $n$ vertices are reconstructible from subgraphs with at most $n/2+1$ vertices
par: Kostochka, Alexandr V., et autres
Publié: (2025)

On the harmonious chromatic number of graphs
par: Araujo-Pardo, Gabriela, et autres
Publié: (2022)

Scaling limits of multitype Bienaymé trees
par: Addario-Berry, Louigi, et autres
Publié: (2025)

The Critical Beta-splitting Random Tree III: The exchangeable partition representation and the fringe tree
par: Aldous, David J., et autres
Publié: (2024)

Asymptotic normality for general subtree counts in conditioned Galton--Watson trees
par: Rakotoniaina, Fameno, et autres
Publié: (2026)

A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
par: Park, Jungeun, et autres
Publié: (2024)

Uniqueness and locality of the ground state of the disordered Monomer-Dimer models on independently weighted Unimodular Bienaymé-Galton-Watson trees
par: Kang, Mihyun, et autres
Publié: (2026)

The inversion statistic in derangements and in other permutations with a prescribed number of fixed points
par: Pinsky, Ross G.
Publié: (2025)

Stein's method and the modular behavior of Eulerian numbers
par: Fulman, Jason, et autres
Publié: (2026)

A note on limits of sequences of binary trees
par: Grübel, Rudolf
Publié: (2023)

Polynomial invariants for rooted trees related to their random destruction
par: Burghart, Fabian
Publié: (2023)

Random trees have height $O(\sqrt{n})$
par: Addario-Berry, Louigi, et autres
Publié: (2022)

Normal approximation for number of edges in random intersection graphs
par: Rybarczyk, Katarzyna, et autres
Publié: (2025)

Bell coloring graphs: realizability and reconstruction
par: Asgarli, Shamil, et autres
Publié: (2025)

Asymptotic height of Plancherel random trees
par: Zhang, Shengjun
Publié: (2026)

Extending the Affirmative Action Problem: mixing numbers and integrated colorings of graphs
par: Burnette, Charles, et autres
Publié: (2025)

The number and structure of connected graphs with a fixed degree sequence
par: Bell, Sasha, et autres
Publié: (2026)

On the concentration of the chromatic number of random graphs
par: Surya, Erlang, et autres
Publié: (2022)

On the Weisfeiler-Leman dimension of circulant graphs
par: Wu, Yulai, et autres
Publié: (2024)

Bootstrap percolation and $P_3$-hull number in direct products of graphs
par: Brešar, Boštjan, et autres
Publié: (2024)

The clique chromatic number of sparse random graphs
par: Fernandez V, Manuel, et autres
Publié: (2024)

Descents and flag major index on conjugacy classes of colored permutation groups without short cycles
par: Liu, Kevin, et autres
Publié: (2025)

When will (game) wars end?
par: Bhatia, Manan, et autres
Publié: (2023)

Note on a Coin Tossing Problem Posed by Daniel Litt
par: Levin, Bruce
Publié: (2024)

Proof of a combinatorial conjecture posed in "The Blimpy Shape of Heady-s and Taily-s Bit Strings"
par: Levin, Bruce
Publié: (2025)

Countable homogeneous ordered bipartite graphs
par: Truss, J. K.
Publié: (2024)