English
Related papers

Related papers: On line colorings of finite projective spaces

200 papers

A line coloring of PG$(n,q)$, the $n$-dimensional projective space over GF$(q)$, is an assignment of colors to all lines of PG$(n,q)$ so that any two lines with the same color do not intersect. The chromatic index of PG$(n,q)$, denoted by…

Combinatorics · Mathematics 2023-06-27 Lei Xu , Tao Feng

The pseudoachromatic index of the finite affine space $\mathrm{AG}(n,q),$ denoted by $\psi'(\mathrm{AG}(n,q)),$ is the the maximum number of colors in any complete line-coloring of $\mathrm{AG}(n,q).$ When the coloring is also proper, the…

The chromatic number of the finite projective space $\mathrm{PG}(n-1,q)$, denoted $\chi_q(n)$, is the minimum number of colors needed to color its points so that no line is monochromatic. We prove subadditivity of $\chi_q(n)$ with respect…

Combinatorics · Mathematics 2026-05-26 Anurag Bishnoi , Wouter Cames van Batenburg , Ananthakrishnan Ravi

We address the problem of finding upper bounds on the chromatic index $q(V,E)$ of linear (and loopless) hypergraphs. The first bound we find is defined through a color-preserving group on a proper and minimally edge-colored linear…

Combinatorics · Mathematics 2025-10-10 Thomas Murff , Xerxes D. Arsiwalla

In this paper, we study the achromatic and the pseudoachromatic numbers of planar and outerplanar graphs as well as planar graphs of girth 4 and graphs embedded on a surface. We give asymptotically tight results and lower bounds for maximal…

Let $ \Pi_q $ be the projective plane of order $ q $, let $\psi(m):=\psi(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…

Combinatorics · Mathematics 2018-10-01 G. Araujo-Pardo , J. J. Montellano-Ballesteros , C. Rubio-Montiel , R. Strausz

Let $V$ be a vector space of dimension $v$ over a field of order $q$. The $q$-Kneser graph has the $k$-dimensional subspaces of $V$ as its vertices, where two subspaces $\alpha$ and $\beta$ are adjacent if and only if $\alpha\cap\beta$ is…

Combinatorics · Mathematics 2007-05-23 Ameera Chowdhury , Chris Godsil , Gordon Royle

In the previous paper, we established an elementary bound for numbers of points of surfaces in the projective $3$-space over ${\Bbb F}_q$. In this paper, we give the complete list of surfaces that attain the elementary bound. Precisely…

Algebraic Geometry · Mathematics 2014-09-23 Masaaki Homma , Seon Jeong Kim

We investigate the upper chromatic number of the hypergraph formed by the points and the $k$-dimensional subspaces of $\mathrm{PG}(n,q)$; that is, the most number of colors that can be used to color the points so that every $k$-subspace…

Combinatorics · Mathematics 2019-09-09 Zoltán L. Blázsik , Tamás Héger , Tamás Szőnyi

We consider a subset of projective space over a finite field and give bounds on the minimal degree of a non-vanishing form with respect to this subset.

Algebraic Geometry · Mathematics 2015-05-26 Samuel Lundqvist

We introduce the concepts of marked multi-colorings, marked chromatic polynomials, and marked (multivariate) independence series for hypergraphs. We show that the coefficients of the q-th power of the marked independence series of a…

Combinatorics · Mathematics 2025-07-29 Chaithra P , Shushma Rani , R. Venkatesh

For complete graphs and n-cubes bounds are found for the possible number of colours in an interval edge colourings.

Discrete Mathematics · Computer Science 2011-11-10 Petros A. Petrosyan

Given a coloring of the k-element subsets of an uncountable separable metric space, we show that there exists an infinite monochromatic subset which contains its limit point.

Metric Geometry · Mathematics 2015-08-11 Shai Rosenberg

In this paper we present the following two results: we give an explicit description of the space of orderings of the field Q(x) as an inverse limit of finite spaces of orderings and we provide a new, simple proof of the fact that the class…

Rings and Algebras · Mathematics 2016-04-26 Pawel Gladki , Bill Jacob

In this paper we find chromatic numbers of distance graphs $G(n,3,2)$ for infinitely many n. Also we improve upper bound for $\chi(G(n,r,s))$ in large part of cases.

Combinatorics · Mathematics 2016-08-08 D. Zakharov

We consider proper colorings of planar graphs embedded in the annulus, such that vertices on one rim can take Q_s colors, while all remaining vertices can take Q colors. The corresponding chromatic polynomial is related to the partition…

Mathematical Physics · Physics 2008-12-18 Jesper Lykke Jacobsen , Hubert Saleur

We classify the irreducible projective representations of symmetric and alternating groups of minimal possible and second minimal possible dimensions, and get a lower bound for the third minimal dimension. On the way we obtain some new…

Representation Theory · Mathematics 2011-12-19 Alexander S. Kleshchev , Pham Huu Tiep

We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…

Combinatorics · Mathematics 2011-05-03 Balázs Keszegh

We calculate a projective space of essential measured laminations in a surface pair, which will be used in another paper to help describe spaces of "finite height laminations."

Geometric Topology · Mathematics 2014-04-15 Ulrich Oertel

We study the a-numbers and p-ranks of Kummer covers of the projective line, and we give bounds for these numbers.

Algebraic Geometry · Mathematics 2007-10-12 Otto Johnston
‹ Prev 1 2 3 10 Next ›