Results 81 to 90 of about 514 (184)
Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.Abstract How hard is it to program n$n$ robots to move about a long narrow aisle while making a series of r−2$r-2$ intermediate stops, provided only w$w$ of the robots can fit across the width of the aisle? In this paper, we answer this question by calculating the rth$r{\text{th}}$‐sequential topological complexity of conf(n,w)$\text{conf}(n,w)$, the ...
Nicholas Wawrykow
wiley +1 more source
On Random Graph Homomorphisms into Z
Journal of Combinatorial Theory, Series B, 2000 AbstractGiven a bipartite connected finite graph G=(V, E) and a vertex v0∈V, we consider a uniform probability measure on the set of graph homomorphisms f:V→Z satisfying f(v0)=0. This measure can be viewed as a G-indexed random walk on Z, generalizing both the usual time-indexed random walk and tree-indexed random walk. Several general inequalities for
Itai Benjamini +2 more
openaire +2 more sources
Quasi‐convex surface subgroups in some one‐relator groups with torsion
Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.Abstract We find surface subgroups in certain one‐relator groups with torsion and use this to deduce a profinite criterion for a word in the free group to be primitive.
Andrew Ng
wiley +1 more source
Homomorphisms of signed planar graphs
CoRR, 2014 Signed graphs are studied since the middle of the last century. Recently, the notion of homomorphism of signed graphs has been introduced since this notion captures a number of well known conjectures which can be reformulated using the definitions of signed homomorphism.
Pascal Ochem +2 more
openaire +2 more sources
Oriented Incidence Colourings of Digraphs
Discussiones Mathematicae Graph Theory, 2019 Brualdi and Quinn Massey [6] defined incidence colouring while study- ing the strong edge chromatic index of bipartite graphs. Here we introduce a similar concept for digraphs and define the oriented incidence chromatic number.
Duffy Christopher +3 more
doaj +1 more source
On the theories classified by an étendue
Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.Abstract We give a model‐theoretic characterisation of the geometric theories classified by étendues—the ‘locally localic’ topoi. They are the theories where each model is determined, syntactically and semantically, by any witness of a fixed collection of formulae.
Joshua L. Wrigley
wiley +1 more source
Graph Similarity and Homomorphism Densities
CoRR, 2021 48th International Colloquium on Automata, Languages, and Programming : ICALP 2021, July 12-16, 2021, Glasgow, Scotland (virtual conference) / edited by Nikhil Bansal, Emanuela Merelli, James Worrell 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, online, 12 Jul 2021 - 16 Jul 2021; Saarbrücken/Wadern : Schloss ...
openaire +5 more sources
Oriented Chromatic Number of Cartesian Products and Strong Products of Paths
Discussiones Mathematicae Graph Theory, 2019 An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without selfloops and arcs in opposite directions. We shall say that H is a coloring graph.
Dybizbański Janusz, Nenca Anna
doaj +1 more source
Associative triples and homomorphisms between travel groupoids on finite geodetic graphs [PDF]
Discrete Mathematics LettersSergiy Kozerenko, Yur-Liubomysl Dekhtiar
doaj +1 more source
The complexity of tropical graph homomorphisms
Discrete Applied Mathematics, 2017 27 pages, 13 figures, 1 table.
Foucaud, Florent +5 more
openaire +3 more sources