Related papers: Rainbow Boomerang Graphs
We show that for every integer $m \ge 2$ and large $n$, every properly edge-coloured graph on $n$ vertices with at least $n (\log n)^{53}$ edges contains a rainbow subdivision of $K_m$. This is sharp up to a polylogarithmic factor. Our…
Van der Waerden's (VDW) colouring theorem in combinatoric number theory [1] has scope for physical applications.The solution of the two colour case has enabled the construction of an explicit mapping of an infinite, one dimensional…
We investigate numerically the scattering of waves on discrete graphs. An efficient algorithm is developed to compute the reflection and transmission (spectral) coefficients. We then explore various configurations of input and output leads,…
A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. In 1980 Hahn conjectured that every properly edge-coloured complete graph $K_n$ has a rainbow Hamiltonian path. Although this…
Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I \subset S$ a monomial ideal. Given a vector $\mathfrak{c}\in\mathbb{Z}_{>0}^n$, the ideal $I_{\mathfrak{c}}$ is the ideal generated by those…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
Although both noncrossing partitions and nonnesting partitions are uniformly enumerated for Weyl groups, the exact relationship between these two sets of combinatorial objects remains frustratingly mysterious. In this paper, we give a…
Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988. The version of this…
The action of a Weyl group on the associated weight lattice induces an additive action on the symmetric algebra and a multiplicative action on the group algebra of the lattice. We show that the coinvariant space of the multiplicative action…
Given a family of graphs $\mathcal{F}$ and an integer $r$, we say that a graph is $r$-Ramsey for $\mathcal{F}$ if any $r$-colouring of its edges admits a monochromatic copy of a graph from $\mathcal{F}$. The threshold for the classic Ramsey…
In one of our recent papers, the associative and the Lie algebras of Weyl type $A[D]=A\otimes F[D]$ were defined and studied, where $A$ is a commutative associative algebra with an identity element over a field $F$ of any characteristic,…
Ramsey's theorem, in the version of Erd\H{o}s and Szekeres, states that every 2-coloring of the edges of the complete graph on {1, 2,...,n} contains a monochromatic clique of order 1/2\log n. In this paper, we consider two well-studied…
Heckenberger introduced the Weyl groupoid of a finite-dimensional Nichols algebra of diagonal type. We replace the matrix of its braiding by a higher tensor and present a construction which yields further Weyl groupoids. Abelian cohomology…
We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…
When many colors appear in edge-colored graphs, it is only natural to expect rainbow subgraphs to appear. This anti-Ramsey problem has been studied thoroughly and yet there remain many gaps in the literature. Expanding upon classical and…
We consider a class of "harmonic variations" for nonsingular curves, obtained as asymptotic degenerations along bitangents. On a geometric level, we obtain an attractive relationship between the class and the genus of $C$. The distribution…
Our main result is a robust generalisation of the Cockayne-Lorimer theorem on the multicolour Ramsey number of matchings. It is moreover a generalisation of the transference generalisation of Cockayne-Lorimer, which (informally) says that…
We discover new linear relations between the chromatic symmetric functions of certain sequences of graphs and apply these relations to find new families of e-positive unit interval graphs. Motivated by the results of Gebhard and Sagan, we…
We present here random distributions on $(D+1)$-edge-colored, bipartite graphs with a fixed number of vertices $2p$. These graphs are dual to $D$-dimensional orientable colored complexes. We investigate the behavior of quantities related to…
In this paper, we develop the basic theory of the shadowing property for local homeomorphisms of metric locally compact spaces, with a focus on applications to edge shift spaces connected with C*-algebra theory. For the local homeomorphism…