Cover Image

On the extrema of the mean subtree order of graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cambie, Stijn, Jooken, Jorik, Wagner, Stephan
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C05, 05C35, 05C40
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The maximum number of connected sets in regular graphs
by: Cambie, Stijn, et al.
Published: (2023)

Sharp results for the Erdős, Pach, Pollack and Tuza problem
by: Cambie, Stijn, et al.
Published: (2025)

The minimum number of maximal independent sets in twin-free graphs
by: Cambie, Stijn, et al.
Published: (2022)

Bounding mean orders of sub-$k$-trees of $k$-trees
by: Cambie, Stijn, et al.
Published: (2023)

The average solution of a TSP instance in a graph
by: Cambie, Stijn
Published: (2022)

Maximum ratio of (graph) irregularities
by: Cambie, Stijn, et al.
Published: (2026)

Trees maximizing the number of almost-perfect matchings
by: Cambie, Stijn, et al.
Published: (2022)

Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
by: Cambie, Stijn, et al.
Published: (2023)

Abundancy of $z$-\v Soltés' digraphs
by: Cambie, Stijn
Published: (2024)

Towards the essence of Šoltés' problem
by: Cambie, Stijn
Published: (2024)

Asymmetric list sizes in bipartite graphs
by: Alon, Noga, et al.
Published: (2020)

Note on extremal problems about connected subgraph sums
by: Cambie, Stijn, et al.
Published: (2025)

Hypergraph saturation for the bow tie
by: Cambie, Stijn, et al.
Published: (2024)

Independent transversals in bipartite correspondence-covers
by: Cambie, Stijn, et al.
Published: (2020)

List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023)

On the girth and connectivity of cubic graphs with a unique longest cycle
by: Jooken, Jorik, et al.
Published: (2024)

A generalization of an ear decomposition and k-trees in highly connected star-free graphs
by: Maezawa, Shun-ichi, et al.
Published: (2025)

Uniform Šoltés' hypergraphs and Šoltés' weighted graphs
by: Cambie, Stijn, et al.
Published: (2025)

On the main distance-based entropies: the eccentricity- and Wiener-entropy
by: Cambie, Stijn, et al.
Published: (2022)

Characterizations of the graphs with dominating parameters
by: Ma, Yuhan
Published: (2024)

Chords of longest cycles in graphs with large circumferences
by: Wu, Haidong, et al.
Published: (2025)

Characterization of the structure of $k$-edge-maximal graphs
by: Xia, Zheng-Jiang, et al.
Published: (2026)

Sparse graphs with an independent or foresty minimum vertex cut
by: Cheng, Kun, et al.
Published: (2024)

On forest and bipartite cuts in sparse graphs
by: Bogdanov, Ilya I., et al.
Published: (2025)

The minimum size of a $k$-connected locally nonforesty graph
by: Li, Chengli, et al.
Published: (2025)

The minimum size of a $3$-connected locally nonforesty graph
by: Li, Chengli, et al.
Published: (2024)

A conjecture implying Thomassen's chord conjecture in graph theory
by: Zhan, Xingzhi
Published: (2024)

Bound vertices of longest paths between two vertices in cubic graphs
by: Li, Chengli, et al.
Published: (2024)

Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
by: Lin, Jifu, et al.
Published: (2024)

Highly connected graphs have highly connected spanning bipartite subgraphs
by: Yuster, Raphael
Published: (2024)

Counting Small Cycle Double Covers
by: Jooken, Jorik, et al.
Published: (2025)

The detour covering number and cummerbund covering number of a graph
by: Li, Chengli, et al.
Published: (2025)

Computational methods for finding bi-regular cages
by: Goedgebeur, Jan, et al.
Published: (2024)

Šoltés' hypergraphs
by: Cambie, Stijn
Published: (2024)

Monochromatic components with many edges in random graphs
by: Fox, Hannah, et al.
Published: (2025)

On asymptotic packing of convex geometric and ordered graphs
by: Nie, Jiaxi, et al.
Published: (2022)

The typical structure of oriented graphs and digraphs with forbidden blow-up of transitive tournaments
by: Liu, Jianxi
Published: (2026)

Spectral extrema of graphs with fixed size: forbidden a fan graph, friendship graph or theta graph
by: Li, Shuchao, et al.
Published: (2024)

Extending Thomassen's conjecture to directed graphs
by: Christoph, Micha, et al.
Published: (2025)

On the most reliable graphs with fixed redundancy
by: Brand, Rotem, et al.
Published: (2026)