# A note on spanning trees with a specified degree sequence

## TL;DR

This paper presents a new Ore-Type condition that guarantees the existence of a spanning tree with a given degree sequence in a graph, advancing understanding of graph structures and spanning trees.

## Contribution

It introduces a novel Ore-Type condition that ensures a graph contains a spanning tree with a specified degree sequence, providing a new criterion for graph structure analysis.

## Key findings

- Established a sufficient Ore-Type condition for spanning trees with a given degree sequence
- Extended classical results to more general degree sequence constraints
- Provided theoretical insights into graph spanning tree configurations

## Abstract

We give an Ore-Type condition sufficient for a graph G to have a spanning tree with a specified degree sequence.