Related papers: Small cycles, generalized prisms and Hamiltonian c…
We provide a new branching rule from the general linear group $GL_{2n}(\mathbb{C})$ to the symplectic group $Sp_{2n}(\mathbb{C})$ by establishing a simple algorithm which gives rise to a bijection from the set of semistandard tableaux of a…
For integers $k\geq 1$ and $n\geq 2k+1$ the Kneser graph $K(n,k)$ has as vertices all $k$-element subsets of $[n]:=\{1,2,\ldots,n\}$ and an edge between any two vertices (=sets) that are disjoint. The bipartite Kneser graph $H(n,k)$ has as…
A Transposition graph $T_n$ is defined as a Cayley graph over the symmetric group $Sym_n$ generated by all transpositions. This paper shows how the spectrum of $T_n$ can be obtained using the spectral properties of the Jucys-Murphy…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
We lay the foundations for a broad algebraic theory encompassing SICs in the hope of elucidating their heuristic connections with Stark units. What emerges is a greatly generalised set-up with added structure and potential for applications…
For a graph X, let f_0(X) denote its number of vertices, d(X) its minimum degree and Z_1(X;Z/2) its cycle space in the standard graph-theoretical sense (i.e. 1-dimensional cycle group in the sense of simplicial homology theory with…
The subdivided double construction on 4-regular graphs was used by Poto\v{c}nik and Wilson to explore semi-symmetric (edge-transitive but not vertex-transitive) graphs, and can be used to construct every semi-symmetric 4-regular graph that…
The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…
Young diagrams are ubiquitous in combinatorics and representation theory. Here we explain these diagrams, focusing on how they are used to classify representations of the symmetric groups $S_n$ and various "classical groups": famous groups…
We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…
In 1970 Lov\'asz conjectured that every connected vertex-transitive graph admits a Hamilton cycle, apart from five exceptional graphs. This conjecture has recently been settled for graphs defined by intersecting set systems, which feature…
We show that if G is a finite group whose commutator subgroup [G,G] has order 2p, where p is an odd prime, then every connected Cayley graph on G has a hamiltonian cycle.
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
A tuple $(G_1,\dots,G_n)$ of graphs on the same vertex set of size $n$ is said to be Hamilton-universal if for every map $\chi: [n]\to[n]$ there exists a Hamilton cycle whose $i$-th edge comes from $G_{\chi(i)}$. Bowtell, Morris, Pehova and…
In 1999, Katona and Kierstead conjectured that if a $k$-uniform hypergraph $\cal H$ on $n$ vertices has minimum co-degree $\lfloor \frac{n-k+3}{2}\rfloor$, i.e., each set of $k-1$ vertices is contained in at least $\lfloor…
The bouquet of circles $B_n$ and dipole graph $D_n$ are two important classes of graphs in topological graph theory. For $n\geq 1$, we give an explicit formula for the average genus $\gamma_{avg}(B_n)$ of $B_n$. By this expression, one…
Generalized splines are an algebraic combinatorial framework that generalizes and unifies various established concepts across different fields, most notably the classical notion of splines and the topological notion of GKM theory. The…
In this paper we extend counting of traversing Hamiltonian cycles from 2-tiled graphs to generalized tiled graphs. We further show that, for a fixed finite set of tiles, counting traversing Hamiltonian cycles can be done in linear time with…
Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…
In this paper, we provide a method to find a Hamiltonian cycle in the prism of a 5-chordal graph, which is $(1+\epsilon)$-tough, with some special conditions.