Results 41 to 50 of about 886,685 (323)
Continuous Orbit Equivalence on Self-Similar Graph Actions
Mathematics, 2019 For self-similar graph actions, we show that isomorphic inverse semigroups associated to a self-similar graph action are a complete invariant for the continuous orbit equivalence of inverse semigroup actions on infinite path spaces.
Inhyeop Yi
doaj +1 more source
Discrete Mathematics, 2011 It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, since finitary infinite matroids must have non-finitary duals. In this paper we illustrate the new theory by exhibiting its implications for the cycle and bond matroids of ...
Henning Bruhn, Reinhard Diestel
openaire +3 more sources
Cycle Double Covers of Infinite Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 In this paper, we study the existence of cycle double covers for infinite planar graphs. We show that every infinite locally finite bridgeless k-indivisible graph with a 2-basis admits a cycle double cover.
Javaheri Mohammad
doaj +1 more source
An advance in infinite graph models for the analysis of transportation networks
International Journal of Applied Mathematics and Computer Science, 2016 This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph.
Cera Martín, Fedriani Eugenio M.
doaj +1 more source
ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS [PDF]
Journal of Algebraic Systems, 2020 A {it local antimagic labeling} of a connected graph $G$ with at least three vertices, is a bijection $f:E(G) rightarrow {1,2,ldots , |E(G)|}$ such that for any two adjacent vertices $u$ and $v$ of $G$, the condition $omega _{f}(u) neq omega _{f}(v ...
S. Shaebani
doaj +1 more source
On the Turán Properties of Infinite Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 Let $G^{(\infty)}$ be an infinite graph with the vertex set corresponding to the set of positive integers ${\Bbb N}$. Denote by $G^{(l)}$ a subgraph of $G^{(\infty)}$ which is spanned by the vertices $\{1,\dots,l\}$. As a possible extension of Turán's theorem to infinite graphs, in this paper we will examine how large $\liminf_{l\rightarrow \infty} {|
Andrzej Dudek, Vojtech Rödl
openaire +3 more sources
On the Structure of a Triangle-Free Infinite-Chromatic Graph of Gyarfas
International Journal of Mathematics and Mathematical Sciences, 1983 Gyárfás has recently constructed an elegant new example of a triangle-free infinite graph G with infinite chromatic number. We analyze its structure by studying the properties of a nested family of subgraphs Gn whose union is G.
Larry Eggan, Frank Harary
doaj +1 more source
SMT Solving for Functional Programming over Infinite Structures [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We develop a simple functional programming language aimed at manipulating infinite, but first-order definable structures, such as the countably infinite clique graph or the set of all intervals with rational endpoints.
Bartek Klin, Michał Szynwelski
doaj +1 more source
Nonplanarity of Iterated Line Graphs
Journal of Mathematics, 2020 The 1-crossing index of a graph G is the smallest integer k such that the kth iterated line graph of G has crossing number greater than 1. In this paper, we show that the 1-crossing index of a graph is either infinite or it is at most 5.
Jing Wang
doaj +1 more source
Infinite friendship graphs with infinite parameters
Journal of Combinatorial Theory, Series B, 1991 We study infinite graphs in which every set of \(\kappa\) vertices has exactly \(\lambda\) common neighbours. We prove that there exist \(2^{\sigma}\) such graphs of each infinite order \(\sigma\) if \(\kappa\) is finite and that for \(\kappa\) infinite there are \(2^{\lambda}\) of them of order \(\lambda\) and none of cardinality greater than ...
Gena Hahn +2 more
openaire +3 more sources