Results 91 to 100 of about 147,491 (227)
Ore's theorem on subfactor planar algebras
, 2019 This article proves that an irreducible subfactor planar algebra with a distributive biprojection lattice admits a minimal 2-box projection generating the identity biprojection.
Palcoux, Sebastien
core
Mathematika, Volume 72, Issue 1, January 2026.Abstract In the “Covering” pursuit game on a graph, a robber and a set of cops play alternately, with the cops each moving to an adjacent vertex (or not moving) and the robber moving to a vertex at distance at most 2 from his current vertex. The aim of the cops is to ensure that, after every one of their turns, there is a cop at the same vertex as the ...
Benjamin Gillott
wiley +1 more source
Conflict-Free Vertex-Connections of Graphs
Discussiones Mathematicae Graph Theory, 2020 A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path ...
Li Xueliang +5 more
doaj +1 more source
Completing Partial k‐Star Designs
Journal of Combinatorial Designs, Volume 33, Issue 12, Page 446-455, December 2025.ABSTRACT A k‐star is a complete bipartite graph K 1 , k. A partial k‐star design of order n is a pair ( V , A ) where V is a set of n vertices and A is a set of edge‐disjoint k‐stars whose vertex sets are subsets of V. If each edge of the complete graph with vertex set V is in some star in A, then ( V , A ) is a (complete) k‐star design.
Ajani De Vas Gunasekara, Daniel Horsley
wiley +1 more source
Combinatorics of the Quantum Symmetric Simple Exclusion Process,\n associahedra and free cumulants [PDF]
, 2021 Philippe Biane
openalex +1 more source
Journal of Combinatorial Designs, Volume 33, Issue 12, Page 456-470, December 2025.ABSTRACT A family ℱ of subsets of [ n ] = { 1 , 2 , … , n } shatters a set A ⊆ [ n ] if for every A ′ ⊆ A, there is an F ∈ ℱ such that F ∩ A = A '. We develop a framework to analyze f ( n , k , d ), the maximum possible number of subsets of [ n ] of size d that can be shattered by a family of size k.
Noga Alon +2 more
wiley +1 more source
Rainbow Connection Number of Dense Graphs
Discussiones Mathematicae Graph Theory, 2013 An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to ...
Li Xueliang +2 more
doaj +1 more source
Journal of Graph Theory, Volume 110, Issue 4, Page 448-456, December 2025.ABSTRACT A dominating K t‐model in a graph G is a sequence ( T 1 , … , T t ) of pairwise disjoint non‐empty connected subgraphs of G, such that for 1 ⩽ i < j ⩽ t every vertex in T j has a neighbour in T i. Replacing ‘every vertex in T j’ by ‘some vertex in T j’ retrieves the standard definition of K t‐model, which is equivalent to K t being a minor of ...
Freddie Illingworth, David R. Wood
wiley +1 more source
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
Expanderizing Higher‐Order Random Walks
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We study a variant of the down‐up (also known as the Glauber dynamics) and up‐down walks over an n$$ n $$‐partite simplicial complex, which we call expanderized higher‐order random walks—where the sequence of updated coordinates corresponds to the sequence of vertices visited by a random walk over an auxiliary expander graph H$$ H $$. When H$$
Vedat Levi Alev, Shravas Rao
wiley +1 more source