Mykhaylo Tyomkyn
We construct a tree T of maximal degree 3 with infinitely many leaves such that whenever finitely many of them are removed, the remaining tree is isomorphic to T. In this sense T resembles an infinite star.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A graph is called primitive if its automorphism group acts primitively on the vertex set. In this paper, we prove a classification of the possible distance sequences of locally infinite primitive graphs. In particular we show that if a primitive graph is locally uncountable, the distance sequence is constant until it terminates. We also prove a constraint on the distance sequences of locally finite infinite graphs.
Parabolic (resp. hyperbolic) self-embeddings of trees are those which do not fix a non-empty finite subtree and preserve precisely one (resp. two) end(s). We prove that a locally finite tree having a parabolic self-embedding is mutually embeddable with infinitely many pairwise non-isomorphic trees, unless the tree is a one-way infinite path. As a result, we conclude that two important properties identified by Bonato-Tardif and Tyomkyn hold for locally finite trees not having any hyperbolic self-embedding.
We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees. Even more, the edges of a clique tree are in bijection with the edges of the corresponding collection of finite trees. This allows us to enumerate the clique trees of a chordal graph and extend various classic characterisations of clique trees to the infinite setting.
This paper investigates a certain 2-Calabi-Yau triangulated category D whose Auslander-Reiten quiver is ZA_{\infty}. We show that the cluster tilting subcategories of D form a so-called cluster structure, and we classify these subcategories in terms of what one may call `triangulations of the infinity-gon'. This is reminiscent of the cluster category C of type A_n which is a 2-Calabi-Yau triangulated category whose Auslander-Reiten quiver is a quotient of ZA_n. The cluster tilting subcategories of C form a cluster structure and they are classified in terms of triangulations of the (n+3)-gon. T…
We study part sizes of supercritical locally restricted sequential structures. This extends previous results about locally restricted integer compositions and part sizes in smooth supercritical compositional structures. Applications are given for runs of subcompositions. The problems are formulated as enumerating directed walks in sized infinite digraphs and the proofs depend heavily on earlier results by Bender and Canfield about infinite transfer matrices.
A graph ${\mathcal G}$ is locally X if the graphs induced on the neighbours of every vertex of ${\mathcal G}$ are isomorphic to the graph $X$. We prove that the infinite family of incidence graphs of the $r$-rank incidence geometries, $Γ(KG(n,k),r)$, constructed using the Kneser graphs $KG(n,k)$, are locally $X$ with $X$ being the incidence graphs of the rank $r-1$ residues of $Γ(KG(n,k),r)$.
Aharoni and Korman (Order 9 (1992) 245--253) have conjectured that every ordered set without infinite antichains possesses a chain and a partition into antichains so that each part intersects the chain. The conjecture is verified for posets whose incomparability graph is locally finite. It follows that the conjecture is true for $(3 + 1)$-free posets with no infinite antichains.
In a series of papers, of which this is the first, we study sufficient conditions for Hamiltonicity in terms of forbidden induced subgraphs and extend such results to locally finite infinite graphs. For this we use topological circles within the Freudenthal compactification of a locally finite graph as infinite cycles. In this paper we focus on conditions involving claws, nets and bulls as induced subgraphs. We extend Hamiltonicity results for finite claw-free and net-free graphs by Shepherd to locally finite graphs. Moreover, we generalise a classification of finite claw-free and net-free gra…
We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.
Two graphs $G$ and $H$ are hypomorphic if there exists a bijection $φ\colon V(G) \rightarrow V(H)$ such that $G - v \cong H - φ(v)$ for each $v \in V(G)$. A graph $G$ is reconstructible if $H \cong G$ for all $H$ hypomorphic to $G$. It is well known that not all infinite graphs are reconstructible. However, the Harary-Schwenk-Scott Conjecture from 1972 suggests that all locally finite trees are reconstructible. In this paper, we construct a counterexample to the Harary-Schwenk-Scott Conjecture. Our example also answers four other questions of Nash-Williams, Halin and Andreae on the reconstruct…
Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives a sufficient condition for Hamiltonicity in locally finite graphs.
Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the random or universal graph of Erd\H os, Rényi and Rado. Automorphism groups and connections with model theory are considered.
In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs. Thus, the arising tangle compactification extends the well-known Freudenthal compactification from connected locally finite graphs to arbitrary infinite graphs. This Master's thesis investigates the tangle compactifcation.
When one studies geometric properties of graphs, local finiteness is a common implicit assumption, and that of transitivity a frequent explicit one. By compactness arguments, local finiteness guarantees several regularity properties. It is generally easy to find counterexamples to such regularity results when the assumption of local finiteness is dropped. The present work focuses on the following problem: determining whether these regularity properties still hold when local finiteness is replaced by an assumption of transitivity. After recalling the locally finite situation, we show that there…
In this paper we extend a result about a sufficient condition for Hamiltonicity for finite graphs by Broersma and Veldmann to locally finite graphs. In order to do this we use topological circles within the Freudenthal compactification of a locally finite graph as infinite cycles. The condition we focus on in this paper is in terms of forbidden induced subgraphs, namely being claw-free and a relaxation of being paw-free.
Developing further Stein's recent notion of relative end degrees in infinite graphs, we investigate which degree assumptions can force a locally finite graph to contain a given finite minor, or a finite subgraph of given minimum degree. This is part of a wider project which seeks to develop an extremal theory of sparse infinite graphs.
We construct the first infinite families of locally arc transitive graphs with the property that the automorphism group has two orbits on vertices and is quasiprimitive on exactly one orbit, of twisted wreath type. This work contributes to Giudici, Li and Praeger's program for the classification of locally arc transitive graphs by showing that the star normal quotient twisted wreath category also contains infinitely many graphs.
Let $F$ be a non-discrete non-Archimedean locally compact field and $\mathcal{O}_F$ the ring of integers in $F$. The main results of this paper are Theorem 1.2 that classifies ergodic probability measures on the space $\mathrm{Mat}(\mathbb{N}, F)$ of infinite matrices with enties in $F$ with respect to the natural action of the group $\mathrm{GL}(\infty,\mathcal{O}_F) \times \mathrm{GL}(\infty,\mathcal{O}_F)$ and Theorem 1.6 that, for non-dyadic $F$, classifies ergodic probability measures on the space $\mathrm{Sym}(\mathbb{N}, F)$ of infinite symmetric matrices with respect to the natural act…
We study the physical Laplacian and the corresponding heat flow on an infinite, locally finite graph with possibly unbounded valence.
Brooks' type theorems for coloring parameters of locally finite graphs and Konig's Lemma
本文研究了无限局部有限连通图着色参数的Brooks型定理，证明其在ZF中不可证但可由Konig引理推导，并提出了与Konig引理等价的新着色参数存在条件，同时给出了ZFC下无限图列表可辨别色数的上界。
A coarse Halin Grid Theorem with applications to quasi-transitive, locally finite graphs
本文证明了粗版本的Halin网格定理：每个一端、局部有限且包含无穷多条射线的不交并作为渐近子式的图，也包含半网格作为渐近子式，并应用于拟传递局部有限图，解决了Georgakopoulos和Papasoglu的猜想与问题。
The problem of determining which infinite lattices are (isomorphic to) sublattices of free lattices is in general unsolved and extremely difficult. In this note, we reduce the problem by proving that all locally finite sublattices of free lattices are countable by using a result from Baldwin, Berman, Glass and Hodges on free algebras.
Carmesin has extended Robertson and Seymour's tree-of-tangles theorem to the infinite tangles of locally finite infinite graphs. We extend it further to the infinite tangles of all infinite graphs. Our result has a number of applications for the topology of infinite graphs, such as their end spaces and their compactifications.
On orientations preserving edge-connectivity in infinite graphs
本文证明可数边端的2k-边连通图存在k-弧连通定向，推广了局部有限情形，并探讨了Nash-Williams猜想的拓扑路径替代方案，证明其对有限分离图成立。
Uniform covers with a finite-dimensional nerve are rare (i.e., do not form a cofinal family) in many separable metric spaces of interest. To get hold on uniform homotopy properties of these spaces, a reasonably behaved notion of an infinite-dimensional metric polyhedron is needed; a specific list of desired properties was sketched by J. R. Isbell in a series of publications in 1959-64. In this paper we construct what appears to be the desired theory of uniform polyhedra; incidentally, considerable information about their metric and Lipschitz properties is obtained.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。