English
Related papers

Related papers: A Dual Ramsey theorem for trees

200 papers

Given a hypergraph $F$ and a number of colours $r$, there exists a hypergraph $H$ of the same girth satisfying $H\longrightarrow (F)_r$. Moreover, for every linear hypergraph $F$ there exists a Ramsey hypergraph $H$ that locally looks like…

Combinatorics · Mathematics 2023-08-31 Christian Reiher , Vojtěch Rödl

We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k edge-disjoint spanning trees.

Combinatorics · Mathematics 2012-03-07 Tomáš Kaiser

We investigate the positivity and extension of invertible sheaves on group homogeneous spaces over coherent bases. Bypassing the failure of standard limit arguments and the classical Weil--Cartier correspondence, we develop a valuative…

Algebraic Geometry · Mathematics 2026-03-24 Ning Guo

We introduce the combinatorial notion of posetted trees and we use it in order to write an explicit expression of the Baker-Campbell-Hausdorff formula.

Combinatorics · Mathematics 2013-04-26 Donatella Iacono , Marco Manetti

We construct of the main object of the Partite Lemma as the colimit over a certain diagram. This gives a purely category theoretic take on the Partite Lemma and establishes the canonicity of the object. Additionally, the categorical point…

Combinatorics · Mathematics 2023-01-24 Sebastian Junge

The gauge theory approach to the geometric Langlands program is extended to the case of wild ramification. The new ingredients that are required, relative to the tamely ramified case, are differential operators with irregular singularities,…

High Energy Physics - Theory · Physics 2007-10-04 Edward Witten

We use the theory of \Gamma-species to enumerate k-gonal and polygonal 2-trees with respect to their vertices. We then extend this result to enumerate "succulents", a tree-like class of graphs which generalize cacti.

Combinatorics · Mathematics 2013-09-19 Andrew Gainer-Dewar

We generalize several recognizability theorems for free single-sorted algebras to the field of many-sorted algebras and provide, in a uniform way and without using neither regular tree grammars nor tree automata, purely algebraic proofs of…

Formal Languages and Automata Theory · Computer Science 2024-01-18 Juan Climent Vidal , Enric Cosme Llópez

We give a revised version of Schmidt's treatment of forms in many variables, which allows us to prove a Hasse principle under more lenient conditions on the number of variables than what had previously been thought possible with these…

Number Theory · Mathematics 2014-07-11 Julia Brandes

We show that the universal homogeneous partial order has finite big Ramsey degrees and discuss several corollaries. Our proof relies on parameter spaces and the Carlson-Simpson theorem rather than on (a strengthening of) the…

Combinatorics · Mathematics 2025-06-09 Jan Hubička

In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled…

Combinatorics · Mathematics 2007-05-23 Seunghyun Seo

In this thesis, we investigate the computational content and the logical strength of Ramsey's theorem and its consequences. For this, we use the frameworks of reverse mathematics and of computable reducibility. We proceed to a systematic…

Logic · Mathematics 2016-02-19 Ludovic Patey

We give a short proof of Cayley's tree formula for counting the number of different labeled trees on $n$ vertices. The following nonlinear recursive relation for the number of labeled trees on $n$ vertices is deduced from a combinatorial…

Combinatorics · Mathematics 2022-12-22 Alok Bhushan Shukla

Let $M$ be a $n$-dimensional complex manifold and $f,g:M\to M$ two distinct holomorphic self-maps. Suppose that $f$ and $g$ coincide on a globally irreducible compact hypersurface $S\subset M$. We show that if one of the two maps is a local…

Complex Variables · Mathematics 2016-04-11 Paolo Arcangeli

Pondering upon the grammatical labeling of 0-1-2 increasing plane trees, we come to the realization that the grammatical labels play a role as records of chopped off leaves of the original increasing binary trees. While such an…

Combinatorics · Mathematics 2022-11-15 William Y. C. Chen , Amy M. Fu , Sherry H. F. Yan

We present the first combinatorial proof of the Graham-Pollak Formula for the determinant of the distance matrix of a tree, via sign-reversing involutions and the Lindstr\"om-Gessel-Viennot Lemma. Our approach provides a cohesive and…

Consider an order $n$ abelian group $G$ and a tree $T$ on $n$ vertices. When is it possible to (bijectively) label $V(T)$ by $G$ so that along all edges $xy$ of $T$, the sums $x+y$ are distinct? This problem can be traced back to the work…

Combinatorics · Mathematics 2025-10-07 Alp Müyesser , Alexey Pokrovskiy

In 2012 M. Soki\'c proved that the class of all finite permutations has the Ramsey property. Using different strategies the same result was then reproved in 2013 by J. B\"ottcher and J. Foniok, in 2014 by M. Bodirsky and in 2015 yet another…

Combinatorics · Mathematics 2017-10-31 Dragan Masulovic

We prove a duality theorem for quantum groupoid (weak Hopf algebra) actions that extends the well-known result for usual Hopf algebras.

Quantum Algebra · Mathematics 2007-05-23 Dmitri Nikshych

We propose a remarkably simple and explicit conjectural formula for a bihamiltonian structure of the double ramification hierarchy corresponding to an arbitrary homogeneous cohomological field theory. Various checks are presented to support…

Mathematical Physics · Physics 2021-06-01 Alexandr Buryak , Paolo Rossi , Sergey Shadrin