scholarly journals Upper Bound on the Circular Chromatic Number of the Plane

10.37236/5418 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Konstanty Junosza-Szaniawski
Keyword(s):  
Chromatic Number ◽  
Upper Bound ◽  
Euclidean Plane ◽  
Circular Chromatic Number

We consider circular version of the famous Nelson-Hadwiger problem. It is know that 4 colors are necessary and 7 colors suffice to color the euclidean plane in such a way that points at distance one get different colors. In $r$-circular coloring we assign arcs of length one of a circle with a perimeter $r$ in such a way that points at distance one get disjoint arcs. In this paper we show the existence of $r$-circular coloring for $r=4+\frac{4\sqrt{3}}{3}\approx 6.30$. It is the first result with $r$-circular coloring of the plane with $r$ smaller than 7. We also show $r$-circular coloring of the plane with $r<7$ in the case when we require disjoint arcs for points at distance belonging to the internal [0.9327,1.0673].

scholarly journals First non-trivial upper bound on circular chromatic number of the plane

2015 ◽  
Vol 49 ◽  
pp. 719-722
Author(s):  
Konstanty Junosza-Szaniawski
Keyword(s):  
Chromatic Number ◽  
Upper Bound ◽  
Circular Chromatic Number

New upper bound for the chromatic number of a random subgraph of a distance graph

2015 ◽  
Vol 97 (3-4) ◽  
pp. 326-332 ◽  
Author(s):  
A. S. Gusev
Keyword(s):  
Chromatic Number ◽  
Upper Bound ◽  
Distance Graph ◽  
Random Subgraph

scholarly journals On r-dynamic coloring of comb graphs

2021 ◽  
Vol 27 (2) ◽  
pp. 191-200
Author(s):  
K. Kalaiselvi ◽  
◽  
N. Mohanapriya ◽  
J. Vernold Vivin ◽  
◽  
...  
Keyword(s):  
Lower Bound ◽  
Chromatic Number ◽  
Upper Bound ◽  
Line Graph ◽  
Proper Coloring ◽  
Total Graph ◽  
Middle Graph ◽  
Different Color

An r-dynamic coloring of a graph G is a proper coloring of G such that every vertex in V(G) has neighbors in at least $\min\{d(v),r\}$ different color classes. The r-dynamic chromatic number of graph G denoted as $\chi_r (G)$, is the least k such that G has a coloring. In this paper we obtain the r-dynamic chromatic number of the central graph, middle graph, total graph, line graph, para-line graph and sub-division graph of the comb graph $P_n\odot K_1$ denoted by $C(P_n\odot K_1), M(P_n\odot K_1), T(P_n\odot K_1), L(P_n\odot K_1), P(P_n\odot K_1)$ and $S(P_n\odot K_1)$ respectively by finding the upper bound and lower bound for the r-dynamic chromatic number of the Comb graph.

scholarly journals T-colorings, divisibility and circular chromatic number

2021 ◽  
Vol 41 (2) ◽  
pp. 441
Author(s):  
Robert Janczewski ◽  
Anna Maria Trzaskowska ◽  
Krzysztof Turowski
Keyword(s):  
Chromatic Number ◽  
Circular Chromatic Number

scholarly journals Circular chromatic number and Mycielski construction

2003 ◽  
Vol 44 (2) ◽  
pp. 106-115 ◽  
Author(s):  
Hossein Hajiabolhassan ◽  
Xuding Zhu
Keyword(s):  
Chromatic Number ◽  
Circular Chromatic Number

scholarly journals On the relative distances of six points in a plane convex body

2005 ◽  
Vol 42 (3) ◽  
pp. 253-264
Author(s):  
Károly Böröczky ◽  
Zsolt Lángi
Keyword(s):  
Convex Body ◽  
Upper Bound ◽  
Euclidean Distance ◽  
Euclidean Plane ◽  
Relative Distance ◽  
Plane Convex ◽  
Euclidean Length ◽  
Plane Convex Body

Let C be a convex body in the Euclidean plane. By the relative distance of points p and q we mean the ratio of the Euclidean distance of p and q to the half of the Euclidean length of a longest chord of C parallel to pq. In this note we find the least upper bound of the minimum pairwise relative distance of six points in a plane convex body.

scholarly journals A new proof of the Larman–Rogers upper bound for the chromatic number of the Euclidean space

2020 ◽  
Vol 276 ◽  
pp. 115-120
Author(s):  
Roman Prosanov
Keyword(s):  
Euclidean Space ◽  
Chromatic Number ◽  
Upper Bound

scholarly journals On Komlós’ tiling theorem in random graphs

2019 ◽  
Vol 29 (1) ◽  
pp. 113-127
Author(s):  
Rajko Nenadov ◽  
Nemanja Škorić
Keyword(s):  
Chromatic Number ◽  
Random Graph ◽  
Random Graphs ◽  
Upper Bound ◽  
Minimum Degree ◽  
Arbitrary Graph ◽  
Spanning Subgraph ◽  
Delta G ◽  
Image Position ◽  
Vertex Disjoint

AbstractGiven graphs G and H, a family of vertex-disjoint copies of H in G is called an H-tiling. Conlon, Gowers, Samotij and Schacht showed that for a given graph H and a constant γ>0, there exists C>0 such that if $p \ge C{n^{ - 1/{m_2}(H)}}$ , then asymptotically almost surely every spanning subgraph G of the random graph 𝒢(n, p) with minimum degree at least $\delta (G) \ge (1 - \frac{1}{{{\chi _{{\rm{cr}}}}(H)}} + \gamma )np$ contains an H-tiling that covers all but at most γn vertices. Here, χcr(H) denotes the critical chromatic number, a parameter introduced by Komlós, and m2(H) is the 2-density of H. We show that this theorem can be bootstrapped to obtain an H-tiling covering all but at most $\gamma {(C/p)^{{m_2}(H)}}$ vertices, which is strictly smaller when $p \ge C{n^{ - 1/{m_2}(H)}}$ . In the case where H = K3, this answers the question of Balogh, Lee and Samotij. Furthermore, for an arbitrary graph H we give an upper bound on p for which some leftover is unavoidable and a bound on the size of a largest H -tiling for p below this value.

An improved upper bound for the acyclic chromatic number of 1-planar graphs

2020 ◽  
Vol 283 ◽  
pp. 275-291
Author(s):  
Wanshun Yang ◽  
Weifan Wang ◽  
Yiqiao Wang
Keyword(s):  
Chromatic Number ◽  
Upper Bound ◽  
Planar Graphs
Sign in / Sign up

Export Citation Format

Share Document