𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The third Ramsey numbers for graphs with at most four edges

✍ Scribed by Yuansheng Yang; Peter Rowlinson

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
356 KB
Volume
125
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The chromaticity of complete bipartite g
The chromaticity of complete bipartite graphs with at most one edge deleted
✍ C. P. Teo; K. M. Koh πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 364 KB πŸ‘ 1 views

## Abstract Let __K(p, q), p ≀ q__, denote the complete bipartite graph in which the two partite sets consist of __p__ and __q__ vertices, respectively. In this paper, we prove that (1) the graph __K(p, q)__ is chromatically unique if __p__ β‰₯ 2; and (2) the graph __K(p, q)__ ‐ __e__ obtained by del

On the density of 2-colorable 3-graphs i
On the density of 2-colorable 3-graphs in which any four points span at most two edges
✍ Klas MarkstrΓΆm; John Talbot πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 161 KB πŸ‘ 1 views

## Abstract Let __ex__~2~(__n, K__) be the maximum number of edges in a 2‐colorable __K__‐free 3‐graph (where __K__={123, 124, 134} ). The 2‐chromatic TurΓ‘n density of __K__ is \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$\pi\_{2}({K}\_{4}^-) =lim\_{{n}\to \infty} {ex}\_{2}

The maximal size of graphs with at most
The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices
✍ Mao-cheng Cai πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 502 KB

Let n and k be positive integers satisfying k + 1 s n s 3k -1, and G a simple graph of order n and size e(G) with at most k edge-disjoint paths connecting any two adjacent vertices. In this paper we prove that e(G) s l(n + k)\*/8], and give complete characterizations of the extremal graphs and the e