✦ LIBER ✦

The number of edge colorings with no monochromatic triangle

✍ Scribed by Yuster, Raphael

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 639 KB
Volume: 21
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199604)21:4<441::aid-jgt10>3.0.co;2-i

No coin nor oath required. For personal study only.

✦ Synopsis

Let F(n, k) denote the maximum number of t w o edge colorings of a graph on n vertices that admit no monochromatic Kk. la complete graph on k vertices). The following results are proved: f ( n , 3) = 2Ln2/41 for all n 2 6. f ( n , k) = 2((k~2)/(2k-2)+o( 1))n'. In particular, the first result solves a conjecture of Erdos and Rothschild.

📜 SIMILAR VOLUMES

On the Number of 3-Edge Colorings of Cub

On the Number of 3-Edge Colorings of Cubic Graphs

✍ Christian Szegedy 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In this paper we present a short algebraic proof for a generalization of a formula of R. Penrose, Some applications of negative dimensional tensors, in: Combinatorial Mathematics and its Applications Welsh (ed.), Academic Press, 1971, pp. 221-244 on the number of 3-edge colorings of a plane cubic gr

On the number of colorings of a snark mi

On the number of colorings of a snark minus an edge

✍ Richard C. Bradley 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

For a given snark G and a given edge e of G, let (G; e) denote the nonnegative integer such that for a cubic graph conformal to G À feg, the number of Tait colorings with three given colors is 18 Á (G; e). If two snarks G 1 and G 2 are combined in certain well-known simple ways to form a snark G, th

The Ramsey Number of an N-Edge Graph ver

The Ramsey Number of an N-Edge Graph versus Triangle Is at Most 2N + 1

✍ A.F. Sidorenko 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 334 KB

Two-Coloring the Edges of a Cubic Graph

Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5

✍ Carsten Thomassen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 113 KB

On the Number of Edges in Hypergraphs Cr

On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings

✍ Alexandr V. Kostochka; Douglas R. Woodall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 94 KB

A colouring of the vertices of a hypergraph G is called strong if, for every edge A, the colours of all vertices in A are distinct. It corresponds to a colouring of the generated graph (G) obtained from G by replacing every edge by a clique. We estimate the minimum number of edges possible in a k-cr

Quantum Number Dependence of Lineshift C

Quantum Number Dependence of Lineshift Coefficients Induced by Collisions with Noble Gas Perturbers in the ν3 Band of NO2

✍ B. Sumpf; S. Bouazza; A. Kissel; H.-D. Kronfeldt 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 163 KB

To complete our study concerning lineshift in the rovibrational spectrum of (14)N(16)O(2), a pulse-driven three-channel lead salt diode laser spectrometer was applied to record high-resolution spectra at room temperature in the 6.2-µm region corresponding to the nu(3) band at low NO(2) concentration