Search arXivSearch

arXiv · 1507.08338

On the pseudoachromatic index of the complete graph III

Abstract

Let $ Π_q $ be the projective plane of order $ q $, let $ψ(m):=ψ(L(K_m))$ the pseudoachromatic number of the complete line graph of order $ m $, let $ a\in \{ 3,4,\dots,\tfrac{q}{2}+1 \} $ and $ m_a=(q+1)^2-a $. In this paper, we improve the upper bound of $ ψ(m) $ given by Araujo-Pardo et al. [J Graph Theory 66 (2011), 89--97] and Jamison [Discrete Math. 74 (1989), 99--115] in the following values: if $ x\geq 2 $ is an integer and $m\in \{4x^2-x,\dots,4x^2+3x-3\}$ then $ψ(m) \leq 2x(m-x-1)$. On the other hand, if $ q $ is even and there exists $ Π_q $ we give a complete edge-colouring of $ K_{m_a} $ with $(m_a-a)q$ colours. Moreover, using this colouring we extend the previous results for $a=\{-1,0,1,2\}$ given by Araujo-Pardo et al. in [J Graph Theory 66 (2011), 89--97] and [Bol. Soc. Mat. Mex. (2014) 20:17--28] proving that $ψ(m_a)=(m_a-a)q$ for $ a\in \{3,4,\dots,\left\lceil \frac{1+\sqrt{4q+9}}{2}\right\rceil -1 \} $.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

G. Araujo-Pardo, J. J. Montellano-Ballesteros, C. Rubio-Montiel, R. Strausz. 2015-07-29. On the pseudoachromatic index of the complete graph III. https://doi.org/10.1007/s00373-017-1872-6

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO