English
Related papers

Related papers: Hamiltonicity in infinite tournaments

200 papers

We construct a path-connected homogenous compactum with cellularity 2^omega that is not homeomorphic to any product of dyadic compacta and first countable compacta. We also prove some closure properties for classes of spaces defined by…

General Topology · Mathematics 2007-05-23 David Milovich

We establish universal approximation theorems for infinite-dimensional geometric rough paths, i.e., we show that continuous functions on the space of infinite-dimensional weakly geometric H\"older continuous rough paths can be approximated…

Probability · Mathematics 2026-03-04 Sonja Cox , Asma Khedher , Thijs Maessen

We show that for any k>1, stratified sets of finite complexity are insufficient to realize all homology classes of codimension k in all smooth manifolds. We also prove a similar result concerning smooth generic maps whose double-point sets…

Algebraic Topology · Mathematics 2014-03-07 Mark Grant , Andras Szucs

We study algebraic properties on a group G such that if the discrete group G has these properties then every locally compact shift continuous topology on G with adjoined zero is either compact, or discrete. We introduce electorally flexible…

Group Theory · Mathematics 2020-06-30 Kateryna Maksymyk

We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings in certain infinite graphs and consequently to establish a…

Combinatorics · Mathematics 2013-09-19 Florian Lehner

Every topological group $G$ has some natural compactifications which can be a useful tool of studying $G$. We discuss the following constructions: (1) the greatest ambit $S(G)$ is the compactification corresponding to the algebra of all…

General Topology · Mathematics 2007-05-23 Vladimir Uspenskij

The hypercube \( Q_n \) contains a Hamiltonian path joining \( x \) and \( y \) (where $x$ and $y$ from the opposite partite set) containing \( P \) if and only if the induced subgraph of \( P \) is a linear forest, where none of these…

Combinatorics · Mathematics 2025-06-27 Abid Ali , Lina Ba , Weihua Yang

We show how to use topological ideas, such as compactness, to establish orderability properties of infinite groups. A new application is to provide a left-ordering for the group of PL homeomorphisms of a connected surface with boundary…

Group Theory · Mathematics 2014-03-20 Dale Rolfsen

We settle the Path Decomposition Conjecture (P.D.C.) due to Tibor Gallai for minimally connected graphs, i.e. trees. We use this validity for trees and settle the P. D. C. using induction on the number of edges for all connected graphs. We…

General Mathematics · Mathematics 2011-06-06 Dhananjay P. Mehendale

We study variants of Sidorenko's conjecture in tournaments, where new phenomena arise that do not have clear analogues in the setting of undirected graphs. We first consider oriented graphs that are systematically under-represented in…

Combinatorics · Mathematics 2024-02-14 Jacob Fox , Zoe Himwich , Nitya Mani , Yunkun Zhou

Following a problem posed by Lov\'asz in 1969, it is believed that every connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from groups having a $(2,s,3)$-presentation, that…

Combinatorics · Mathematics 2007-05-23 Henry Glover , Dragan Marusic

We show that every finite group occurs as the automorphism group of infinitely many finite (field) extensions of any given Hilbertian field. This extends and unifies previous results of M. Fried and Takahashi on the global field case.

Number Theory · Mathematics 2017-12-19 François Legrand , Elad Paran

The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph $H$, but good characterisations have been found for only a handful of non-trivial pattern graphs. The complete graph on five vertices,…

Discrete Mathematics · Computer Science 2017-05-05 Rebecca Robinson , Graham Farr

In this thesis we prove a variety of theorems on tournaments. A \emph{prime} tournament is a tournament $G$ such that there is no $X \subseteq V(G)$, $1 < |X| < |V(G)|$, such that for every vertex $v \in V(G) \minus X$, either $v \ra x$ for…

Combinatorics · Mathematics 2012-07-03 Gaku Liu

We prove that for every $\varepsilon > 0$ there is $c_0$ such that if $G\sim G(n,c/n)$, $c\ge c_0$, then with high probability $G$ can be covered by at most $(1+\varepsilon)\cdot \frac{1}{2}ce^{-c} \cdot n$ vertex disjoint paths, which is…

Combinatorics · Mathematics 2023-12-27 Yahav Alon , Michael Krivelevich

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Combinatorics · Mathematics 2010-09-06 Jan Hubicka

In light of Lov\'{a}sz's longstanding question on the existence of Hamilton paths in vertex-transitive graphs, this paper considers a natural variant: what if vertex-transitivity is relaxed, yet a high degree of symmetry--specifically…

Combinatorics · Mathematics 2026-02-17 Shaofei Du , Kai Yuan

For a compact smooth manifold $M$ (with boundary) we prove that the topological rank of the diffeomorphism group Diff$_0^k(M)$ is finite for all $k\geq 1$. This extends a result from [2] where the same claim is proved in the special case of…

Group Theory · Mathematics 2015-10-16 Azer Akhmedov

A topological group G is h-complete if every continuous homomorphic image of G is (Raikov-)complete; we say that G is hereditarily h-complete if every closed subgroup of G is h-complete. In this paper, we establish open-map properties of…

General Topology · Mathematics 2011-09-27 Gábor Lukács

We introduce a notion of topological entropy for continuous actions of compactly generated topological groups on compact Hausdorff spaces. It is shown that any continuous action of a compactly generated topological group on a compact…

Group Theory · Mathematics 2015-02-16 Friedrich Martin Schneider