Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.12155

Gallai-Ramsey numbers for graphs with five vertices and eight edges

Xueli Su·Yan Liu
View original source ↗Read source document ↗Export metadata ↓

Abstract

A Gallai $k$-coloring is a $k$-edge coloring of a complete graph in which there are no rainbow triangles. For given graphs $G_1, G_2, G_3$ and nonnegative integers $r, s, t$ with that $k=r+s+t$, the $k$-colored Gallai-Ramsey number $gr_{k}(K_{3}: r\cdot G_1,~ s\cdot G_2, ~t\cdot G_3)$ is the minimum integer $n$ such that every Gallai $k$-colored $K_{n}$ contains a monochromatic copy of $G_1$ colored by one of the first $r$ colors or a monochromatic copy of $G_2$ colored by one of the middle $s$ colors or a monochromatic copy of $G_3$ colored by one of the last $t$ colors. In this paper, we determine the value of Gallai-Ramsey number in the case that $G_1=B_{3}^{+}$, $G_2=S_{3}^+$ and $G_3=K_3$. Then the Gallai-Ramsey number $gr_{k}(K_{3}: B_{3}^{+})$ is obtained. Thus the Gllai-Ramsey numbers for graphs with five vertices and eight edges are solved completely. Furthermore, the the Gallai-Ramsey numbers $gr_{k}(K_{3}: r\cdot B_3^+,~ (k-r)\cdot S_3^+)$, $gr_{k}(K_{3}: r\cdot B_3^+,~ (k-r)\cdot K_3)$ and $gr_{k}(K_{3}: s\cdot S_3^+,~ (k-s)\cdot K_3)$ are obtained, respecticely.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xueli Su, Yan Liu. 2020-08-26. Gallai-Ramsey numbers for graphs with five vertices and eight edges. https://arxiv.org/abs/2008.12155

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO↗
arXiv2026

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO↗
arXiv2026

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO↗