scholarly journals Configurations in projective planes and quadrilateral-star Ramsey numbers

2008 ◽  
Vol 308 (17) ◽  
pp. 3986-3991 ◽  
Author(s):  
E.L. Monte Carmelo
10.37236/773 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Jeremy F. Alm ◽  
Roger D. Maddux ◽  
Jacob Manske

Let $K_{N}$ denote the complete graph on $N$ vertices with vertex set $V = V(K_{N})$ and edge set $E = E(K_{N})$. For $x,y \in V$, let $xy$ denote the edge between the two vertices $x$ and $y$. Let $L$ be any finite set and ${\cal M} \subseteq L^{3}$. Let $c : E \rightarrow L$. Let $[n]$ denote the integer set $\{1, 2, \ldots, n\}$. For $x,y,z \in V$, let $c(xyz)$ denote the ordered triple $\big(c(xy)$, $c(yz), c(xz)\big)$. We say that $c$ is good with respect to ${\cal M}$ if the following conditions obtain: 1. $\forall x,y \in V$ and $\forall (c(xy),j,k) \in {\cal M}$, $\exists z \in V$ such that $c(xyz) = (c(xy),j,k)$; 2. $\forall x,y,z \in V$, $c(xyz) \in {\cal M}$; and 3. $\forall x \in V \ \forall \ell\in L \ \exists \, y\in V$ such that $ c(xy)=\ell $. We investigate particular subsets ${\cal M}\subseteq L^{3}$ and those edge colorings of $K_{N}$ which are good with respect to these subsets ${\cal M}$. We also remark on the connections of these subsets and colorings to projective planes, Ramsey theory, and representations of relation algebras. In particular, we prove a special case of the flexible atom conjecture.


10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.


2020 ◽  
Vol 87 ◽  
pp. 103100
Author(s):  
Martin Balko ◽  
Máté Vizer
Keyword(s):  

1991 ◽  
Vol 257 (1-2) ◽  
pp. 51-55
Author(s):  
D. Johnston
Keyword(s):  

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 735
Author(s):  
Tomasz Dzido ◽  
Renata Zakrzewska

We consider the important generalisation of Ramsey numbers, namely on-line Ramsey numbers. It is easiest to understand them by considering a game between two players, a Builder and Painter, on an infinite set of vertices. In each round, the Builder joins two non-adjacent vertices with an edge, and the Painter colors the edge red or blue. An on-line Ramsey number r˜(G,H) is the minimum number of rounds it takes the Builder to force the Painter to create a red copy of graph G or a blue copy of graph H, assuming that both the Builder and Painter play perfectly. The Painter’s goal is to resist to do so for as long as possible. In this paper, we consider the case where G is a path P4 and H is a path P10 or P11.


2021 ◽  
Vol 404 ◽  
pp. 126220
Author(s):  
Ye Wang ◽  
Yusheng Li ◽  
Yan Li
Keyword(s):  

2021 ◽  
Vol 225 (10) ◽  
pp. 106709
Author(s):  
Piotr Pokora ◽  
Halszka Tutaj-Gasińska
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document