Results 21 to 30 of about 134 (93)
Fast Construction on a Restricted Budget
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We introduce a model of a controlled random graph process. In this model, the edges of the complete graph Kn$$ {K}_n $$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably, whether to purchase each observed edge.
Alan Frieze +2 more
wiley +1 more source
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source
A Dichotomy Theorem for Γ‐Switchable H‐Colouring on m‐Edge‐Coloured Graphs
Journal of Graph Theory, Volume 110, Issue 2, Page 200-208, October 2025.ABSTRACT Let G be a graph in which each edge is assigned one of the colours 1 , 2 , … , m, and let Γ be a subgroup of S m. The operation of switching at a vertex x of G with respect to an element π of Γ permutes the colours of the edges incident with x according to π.
Richard Brewster +2 more
wiley +1 more source
Journal of Graph Theory, Volume 110, Issue 1, Page 82-91, September 2025.ABSTRACT An inversion of a tournament T is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let inv k ( T ) be the minimum length of a sequence of inversions using sets of size at most k that result in the transitive tournament.
Raphael Yuster
wiley +1 more source
The Generic Circular Triangle‐Free Graph
Journal of Graph Theory, Volume 109, Issue 4, Page 426-445, August 2025.ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G embeds into C 3 if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 }‐free graph.
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley +1 more source
Periodic Orbits of MAX and MIN Multistate Networks
Mathematical Methods in the Applied Sciences, Volume 48, Issue 12, Page 11620-11629, August 2025.ABSTRACT This work presents a generalization of Boolean networks to multistate networks over a complement‐closed set 𝒞, which can be finite or infinite. Specifically, we focus on MAX (and MIN) multistate networks, whose dynamics are governed by global arbitrary 𝒞‐maxterm (or 𝒞‐minterm) functions, which extend the well‐known maxterm (or minterm) Boolean
Juan A. Aledo +3 more
wiley +1 more source
Sequentially Constrained Hamilton Cycles in Random Graphs
Random Structures &Algorithms, Volume 67, Issue 1, August 2025.ABSTRACT We discuss the existence of Hamilton cycles in the random graph Gn,p$$ {G}_{n,p} $$ where there are restrictions caused by (i) coloring sequences, (ii) a subset of vertices must occur in a specific order, and (iii) there is a bound on the number of inversions in the associated permutation.
Alan Frieze, Wesley Pegden
wiley +1 more source
Methods in Ecology and Evolution, Volume 16, Issue 8, Page 1851-1867, August 2025.Abstract Being able to infer the interactions between a set of species from observations of the system is of paramount importance to obtain explanatory and predictive models in ecology. We tackled this challenge by employing qualitative modelling frameworks and logic methods for the synthesis of mathematical models that can integrate both observations ...
Loïc Paulevé, Cédric Gaucherel
wiley +1 more source
Mathematical Methods in the Applied Sciences, Volume 48, Issue 7, Page 7550-7567, 15 May 2025.Forensic linguistics and stylometry have in the exploration of linguistic patterns one of their fundamental tools. Mathematical structures such as complex multilayer networks and hypergraphs provide remarkable resources to represent and analyze texts.
Ángeles Criado‐Alonso +3 more
wiley +1 more source
Large-scale simulation of traffic flow using Markov model. [PDF]
PLoS One, 2021 Besenczi R +5 more
europepmc +1 more source