Results 21 to 30 of about 709,702 (295)
Retracts of Infinite Hamming Graphs [PDF]
Journal of Combinatorial Theory, Series B, 1997 A Hamming graph is a Cartesian product of complete graphs. We show that (finite or infinite) quasi-median graphs, which are a generalization of median graphs, are exactly the retracts of Hamming graphs. This generalizes a result of \textit{H. J. Bandelt} [J.
Chastand, Marc
openaire +4 more sources
A Note on Intertwines of Infinite Graphs [PDF]
Journal of Combinatorial Theory, Series B, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oporowski, B., Oporowski, Bogdan
openaire +3 more sources
On Ramsey-Minimal Infinite Graphs [PDF]
The Electronic Journal of Combinatorics, 2021 For fixed finite graphs $G$, $H$, a common problem in Ramsey theory is to study graphs $F$ such that $F \to (G,H)$, i.e. every red-blue coloring of the edges of $F$ produces either a red $G$ or a blue $H$. We generalize this study to infinite graphs $G$, $H$; in particular, we want to determine if there is a minimal such $F$.
Jordan Mitchell Barrett, Valentino Vito
openaire +4 more sources
Graphoidally independent infinite graphs
AKCE International Journal of Graphs and Combinatorics, 2021 A graphoidal cover of a graph G (not necessarily finite) is a collection ψ of paths in G, called ψ-edges, (not necessarily finite, not necessarily open) satisfying the following axioms: (GC-1) Every vertex of G is an internal vertex of at most one path ...
Purnima Gupta, Deepti Jain
doaj +1 more source
Duality in Infinite Graphs [PDF]
Combinatorics, Probability and Computing, 2006 The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstructions fall away when duality is reinterpreted on the basis of a ‘singular’ approach to graph homology, whose cycles are defined topologically in a space formed by the graph ...
Henning Bruhn, Reinhard Diestel
openaire +2 more sources
Ricci Curvature on Birth-Death Processes
Axioms, 2023 In this paper, we study curvature dimension conditions on birth-death processes which correspond to linear graphs, i.e., weighted graphs supported on the infinite line or the half line. We give a combinatorial characterization of Bakry and Émery’s CD(K,n)
Bobo Hua, Florentin Münch
doaj +1 more source
On the tangle compactification of infinite graphs [PDF]
, 2019 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.
Kurkofka, Jan
core +5 more sources
Unfolding of Finite Concurrent Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.
Alexandre Mansard
doaj +1 more source
A new class of graceful graphs: k-enriched fan graphs and their characterisations
Cubo, 2021 The Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of the best known open problems in Graph Theory.
M. Haviar, S. Kurtulík
doaj +1 more source
Unavoidable topological minors of infinite graphs [PDF]
, 2010 This is the post-print version of the Article - Copyright @ 2010 ElsevierA graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite ...
Ding, Guoli +5 more
core +1 more source