Search arXivSearch

arXiv · 2602.03966

Matchings: Source, Goal and Faithful Companion

Abstract

Matchings were among the earliest motivations for graph theory. They subsequently remained a central goal, inspiring the development of new mathematical tools that went well beyond problems directly concerning matchings. These tools proved widely applicable, accompanying the growth of graph theory over the past century. A milestone in this trajectory is W.T. Tutte, The factorisation of linear graphs, J. Lond. Math. Soc. (1), 22, no. 2, (1947), 107-111., which firmly embedded graph theory - through matchings - into the body of classical mathematics, in particular, linear algebra and polynomials. We revisit this article of Tutte, presenting its original content, sketching some aspects of its impact until some recent progress, and trace one of its subsequent lines of development finally leading to a new contribution answering an open challenge and extending known results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

András Sebő. 2026-08-15. Matchings: Source, Goal and Faithful Companion. https://arxiv.org/abs/2602.03966

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO