Related papers: Note on graph-based BCJ relation for Berends-Giele…
Fiber graphs of Gr\"obner bases from contingency tables are important in statistical hypothesis testing, where one studies random walks on these graphs using the Metropolis-Hastings algorithm. The connectivity of the graphs has implications…
We develop a structural approach to simultaneous embeddability in temporal sequences of graphs, inspired by graph minor theory. Our main result is a classification theorem for 2-connected temporal sequences: we identify five obstruction…
In this paper we present a simple unifying approach to prove several statements about intersecting and cross-intersecting families, including the Erd\H os--Ko--Rado theorem, the Hilton--Milner theorem, a theorem due to Frankl concerning the…
We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…
Celestial amplitude plays an important role in the understanding of holography. Computing celestial amplitudes by recursion can deepen our understanding of the structure of celestial amplitudes. As an important recursion method, the…
In this paper, we provide a thorough study on the expansion of single trace Einstein-Yang-Mills amplitudes into linear combination of color-ordered Yang-Mills amplitudes, from various different perspectives. Using the gauge invariance…
Britto, Cachazo and Feng have recently derived a recursion relation for tree-level scattering amplitudes in Yang-Mills. This relation has a bilinear structure inherited from factorisation on multi-particle poles of the scattering amplitudes…
Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the…
The concept of the brush number $b_r(G)$ was introduced for a simple connected undirected graph $G$. The concept will be applied to the Mycielskian graph $\mu(G)$ of a simple connected graph $G$ to find $b_r(\mu(G))$ in terms of an…
The $b$-vector $(b_1,b_2\ldots,b_d)$ of a graph $G$ is defined in terms of its clique vector $(c_1,c_2\ldots,c_d)$ by the equation $\sum^d_{i=1}b_i(x+1)^{i-1}=\sum^d_{i=1} c_i x^{i-1},$ where $d$ is the largest cardinality of a clique in…
A graph is locally chordal if each of its small-radius balls is chordal. In an earlier work [AKK25], the authors and Kobler proved that locally chordal graphs can be characterized by having chordal local covers, by forbidding short cycles…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of…
The Ferrers bound conjecture is a natural graph-theoretic extension of the enumeration of spanning trees for Ferrers graphs. We document the current status of the conjecture and provide a further conjecture which implies it.
Hadwiger's conjecture asserts that any graph contains a clique minor with order no less than the chromatic number of the graph. We prove that this well-known conjecture is true for all graphs if and only if it is true for squares of split…
We prove that the notion of a derived voltage graph comes from an adjunction between the category of voltage graphs and a category of group labeled graphs.
We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…
In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a Poisson process approximation that, for graphs which have independent edges, with a possibly…
We introduce a new variant of the coarse Baum-Connes conjecture designed to tackle coarsely disconnected metric spaces called the boundary coarse Baum-Connes conjecture. We prove this conjecture for many coarsely disconnected spaces that…
Berends-Giele currents are fundamental building blocks for on-shell amplitudes in non-abelian gauge theory. We present a novel procedure to construct them using the Bern-Kosower formalism for one-loop gluon amplitudes. Applying the pinch…