On regular hypergraphs with high girth and high chromatic number

2015 ◽  
Vol 25 (5) ◽  
Author(s):  
Alina E. Khuzieva ◽  
Dmitriy A. Shabanov

AbstractThe paper is concerned with an extremal problem of combinatorial analysis on finding the minimal possible number of edges in an n-regular hypergraph with chromatic number greater than r and girth greater than s. A new lower estimate of this extremal value is obtained and a number of related results is proved.

2016 ◽  
Vol 339 (11) ◽  
pp. 2819-2825
Author(s):  
Gabriela Araujo-Pardo ◽  
Juan Carlos Díaz-Patiño ◽  
Luis Montejano ◽  
Deborah Oliveros

Author(s):  
Albert William ◽  
Roy Santiago ◽  
Indra Rajasingh

Author(s):  
K. Rajalakshmi ◽  
M. Venkatachalam ◽  
M. Barani ◽  
D. Dafik

The packing chromatic number $\chi_\rho$ of a graph $G$ is the smallest integer $k$ for which there exists a mapping $\pi$ from $V(G)$ to $\{1,2,...,k\}$ such that any two vertices of color $i$ are at distance at least $i+1$. In this paper, the authors find the packing chromatic number of subdivision vertex join of cycle graph with path graph and subdivision edge join of cycle graph with path graph.


2021 ◽  
Vol 1836 (1) ◽  
pp. 012026
Author(s):  
M Y Rohmatulloh ◽  
Slamin ◽  
A I Kristiana ◽  
Dafik ◽  
R Alfarisi

1989 ◽  
Vol 23 (3) ◽  
pp. 31-40 ◽  
Author(s):  
X. Viennot ◽  
G. Eyrolles ◽  
N. Janey ◽  
D. Arqués

1986 ◽  
Vol 84 ◽  
pp. 213-223 ◽  
Author(s):  
Vlastimil Pták
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document