Spanning trees with few branch vertices

@article{DeBiasio2019SpanningTW,
  title={Spanning trees with few branch vertices},
  author={Louis DeBiasio and Allan Lo},
  journal={ArXiv},
  year={2019},
  volume={abs/1709.04937}
}
  • Louis DeBiasio, Allan Lo
  • Published in SIAM J. Discrete Math. 2019
  • Mathematics, Computer Science
  • A branch vertex in a tree is a vertex of degree at least three. We prove that for all positive integers $s$, every connected graph on $n$ vertices with minimum degree at least $(\frac{1}{s+3}+o(1))n$ contains a spanning tree having at most $s$ branch vertices. Asymptotically, this is best possible and solves a problem of Flandrin, Kaiser, Kuuzel, Li and Ryjaucek, which was originally motivated by an optimization problem in the design of optical networks. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    1
    Twitter Mention

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES

    Monochromatic cycle partitions of graphs with large minimum degree

    VIEW 5 EXCERPTS

    A Dirac-Type Theorem for 3-Uniform Hypergraphs

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Independence trees and Hamilton cycles

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Spanning spiders and light-splitting switches

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Approximating Spanning Trees with Few Branches

    VIEW 1 EXCERPT