Bounding the strong chromatic index of dense random graphs

Andrzej Czygrinow, Brendan Nagle

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

For a graph G, a strong edge coloring of G is an edge coloring in which every color class is an induced matching. The strong chromatic index of G,χs(G), is the smallest number of colors in a strong edge coloring of G. Palka (Austral. J. Combin. 18 (1998) 219-226), proved that if p=p(n)=Θ(n-1), then with high probability, χ s(G(n,p))=O(Δ(G(n,p))). Recently Vu (Combin. Probab. Comput. 11 (2002) 103-111), proved that if n-1(lnn) 1+δ≤p=p(n)≤n for any 0<ε,δ<1, then with high probability, χ s(G(n,p))=O((pn)2/ln(pn)). In this note, we prove that if p=p(n)>n for all ε>0, then with b=(1-p) -1, with high probability, (1-o(1))(pn2/log bn)≤χs(G(n,p))≤(2+o(1))(pn2/logbn).

Original languageEnglish (US)
Pages (from-to)129-136
Number of pages8
JournalDiscrete Mathematics
Volume281
Issue number1-3
DOIs
StatePublished - Apr 28 2004

Keywords

  • Random graphs
  • Strong chromatic index

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Bounding the strong chromatic index of dense random graphs'. Together they form a unique fingerprint.

  • Cite this