相关论文: All cycle-chords are $e$-positive

Motivated by Stanley's conjecture about the $e$-positivity of claw-free incomparability graphs, Hamel and her collaborators studied the $e$-positivity of $(claw, H)$-free graphs, where $H$ is a four-vertex graph. In this paper we establish…

For all Artin groups, we characterise the girth (i.e. the length of a shortest cycle) of the defining graph algebraically, showing that it is an isomorphism invariant. Using this result, we prove that the Artin groups based on a cycle graph…

Motivated by Stanley's $\mathbf{(3+1)}$-free conjecture on chromatic symmetric functions, Foley, Ho\`{a}ng and Merkel introduced the concept of strong $e$-positivity and conjectured that a graph is strongly $e$-positive if and only if it is…

A cyclic base ordering of a connected graph $G$, is a cyclic ordering of $E(G)$ such that every cyclically consecutive $|V(G)|-1$ edges form a spanning tree. In this project, we study cyclic base ordering of various families of graphs,…

An edge colouring of a graph $G$ is called acyclic if it is proper and every cycle contains at least three colours. We show that for every $\varepsilon>0$, there exists a $g=g(\varepsilon)$ such that if $G$ has girth at least $g$ then $G$…

We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…

Xu and Wu proved that if every $5$-cycle of a planar graph $G$ is not simultaneously adjacent to $3$-cycles and $4$-cycles, then $G$ is $4$-choosable. In this paper, we improve this result as follows. Let $\{i, j, k, l\} = \{3,4,5,6\}.$ For…

In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…

We give a (computer assisted) proof that the edges of every graph with maximum degree 3 and girth at least 17 may be 5-colored (possibly improperly) so that the complement of each color class is bipartite. Equivalently, every such graph…

Periodic orbit theory provides two important functions---the dynamical zeta function and the spectral determinant for the calculation of dynamical averages in a nonlinear system. Their cycle expansions converge rapidly when the system is…

A graph $G = (V, E)$ is said to be word-representable if a word $w$ can be formed using the letters of the alphabet $V$ such that for every pair of vertices $x$ and $y$, $xy \in E$ if and only if $x$ and $y$ alternate in $w$. A…

Motivated by the notion of nice graphs, we introduce the concept of strongly nice property, which can be used to study the Schur positivity of symmetric functions. We show that a graph and all its induced subgraphs are strongly nice if and…

We say that two sets $S,T\subset\{1,2,\dots,n\}$ are chord separated if there does not exist a cyclically ordered quadruple $a,b,c,d$ of integers satisfying $a,c\in S-T$ and $b,d\in T-S$. This is a weaker version of Leclerc and Zelevinsky's…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

We obtain the Schur positivity of spider graphs of the forms $S(a,2,1)$ and $S(a,4,1)$, which are considered to have the simpliest structures for which the Schur positivity was unknown. The proof outline has four steps. First, we find…

The chromatic symmetric function of a graph is a generalization of the chromatic polynomial. The key motivation for studying the structure of a chromatic symmetric function is to answer positivity conjectures by Stanley in 1995 and Gasharov…

Let $G$ be a bridgeless cubic graph. Consider a list of $k$ 1-factors of $G$. Let $E_i$ be the set of edges contained in precisely $i$ members of the $k$ 1-factors. Let $\mu_k(G)$ be the smallest $|E_0|$ over all lists of $k$ 1-factors of…

We prove a conjecture of K\"uhn, Osthus, Townsend and Zhao \cite{kuhn2017structure} stating that almost every $C_k$-free oriented graph on $n$ vertices has $\Theta(n)$ backwards edges in a transitive-optimal ordering. The same holds for…

For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…

We prove that for every digraph $D$ and every choice of positive integers $k$, $\ell$ there exists a digraph $D^*$ with girth at least $\ell$ together with a surjective acyclic homomorphism $\psi\colon D^*\to D$ such that: (i) for every…