The burning process on a graph $G$ starts with a single burnt vertex, and at each subsequent step, burns the neighbors of the currently burnt vertices, as well as one other unburnt vertex. The burning number of $G$ is the smallest number of steps req...
We consider a four-vertex model introduced by Bálint Tóth: a dependent bond percolation model on $\mathbb{Z}^2$ in which every edge is present with probability 1/2 and each vertex has exactly two incident edges, perpendicular to each other. We pr...
An orientation of a graph $G$ is {\it in-out-proper} if any two adjacent vertices have different in-out-degrees, where the in-out-degree of each vertex is equal to the in-degree minus the out-degree of that vertex. The {\it in-out-proper orientation...
For a graph $G=(V,E)$, a set $D\subset V(G)$ is a strong dominating set of $G$, if for every vertex $x\in V (G)\setminus D$ there is a vertex $y\in D$ with $xy \in E(G)$ and $deg(x)\leq deg(y)$. A strong coalition consists of two disjoint sets of ver...
Brooks' Theorem [R. L. Brooks, On Colouring the Nodes of a Network, Proc. Cambridge Philos. Soc.} 37:194-197, 1941] states that every graph $G$ with maximum degree $Δ$, has a vertex-colouring with $Δ$ colours, unless $G$ is a complete graph or an o...
In a Take-Away Game on hypergraphs, two players take turns to remove the vertices and the hyperedges of the hypergraphs. In each turn, a player must remove either a single vertex or a hyperedge. When a player chooses to remove one vertex, all of the...
Tags: algorithm, graph, path-finding, planar-graph | Score: 0
Tags: c++, opengl, glsl, profiling, glfw | Score: 1
We investigate a variant of the chip-firing process on the infinite path graph: rather than treating the chips as indistinguishable, we label them with positive integers. To fire an unstable vertex, i.e. a vertex with more than one chip, we choose an...
We consider correlation functions for a vertex operator algebra on a genus two Riemann surface formed by sewing two tori together. We describe a generalisation of genus one Zhu recursion where we express an arbitrary genus two $n$--point correlation...
Given a configuration of pebbles on the vertices of a graph $G$, a pebbling move removes two pebbles from a vertex and puts one pebble on an adjacent vertex. The pebbling number of a graph $G$ is the smallest number of pebbles required such that, giv...
An even (resp. odd) lollipop is the coalescence of a cycle of even (resp. odd) length and a path with pendant vertex as distinguished vertex. It is known that the odd lollipop is determined by its spectrum and the question is asked by W. Haemers, X...
Let $G$ be a bipartite planar graph with edges directed from black to white. For each vertex $v$ let $n_v$ be a positive integer. A multiweb in $G$ is a multigraph with multiplicity $n_v$ at vertex $v$. A connection is a choice of linear maps on edge...
We discuss how to construct limit shapes for the domino tiling model (square lattice dimer model) and $5$-vertex model, in appropriate polygonal domains. Our methods are based on the harmonic extension method of [R. Kenyon and I. Prause, Gradient var...
The physics aims at the proposed future high-energy linear $e^+e^-$ collider CLIC pose challenging demands on the performance of the detector system. In particular, the vertex and tracking detectors have to combine a spatial resolution of a few micro...
Consider a directed multigraph $D$ that is balanced (i.e., at each vertex, the indegree equals the outdegree). Let $A$ be its set of arcs. Fix an integer $k$. Let $s$ be a vertex of $D$. We show that the number of $k$-element subsets $B$ of $A$ that...
In order to extend the tracking acceptance, to improve the primary and secondary vertex reconstruction and thus enhancing the tagging capabilities for short lived particles, the ZEUS experiment at the HERA Collider at DESY installed a silicon strip...
We show that the construction of vertex algebras from Costello-Gwilliam factorization algebras on $\mathbb{C}$ can be achieved without the discreteness condition on the weight spaces. Furthermore, we construct locally constant factorization algebras...
Vertex algebras and factorization algebras are two approaches to chiral conformal field theory. Costello and Gwilliam describe how every holomorphic factorization algebra on the plane of complex numbers satisfying certain assumptions gives rise to a...
We find a positive $e_I$-expansion for the chromatic symmetric function of KPKP graphs, which are graphs obtained by connecting a vertex in a complete graph with a vertex in the maximal clique of a lollipop graph by a path. This generalizes the posit...