Hostname: page-component-77f85d65b8-6bnxx Total loading time: 0 Render date: 2026-03-30T06:26:56.640Z Has data issue: false hasContentIssue false
  • English
  • Français

A Random Recolouring Method for Graphs and Hypergraphs

Published online by Cambridge University Press:  12 September 2008

Colin McDiarmid
Colin McDiarmid
Affiliation:
Department of Statistics, University of Oxford
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider a simple randomised algorithm that seeks a weak 2-colouring of a hypergraph H; that is, it tries to 2-colour the points of H so that no edge is monochromatic. If H has a particular well-behaved form of such a colouring, then the method is successful within expected number of iterations O(n3) when H has n points. In particular, when applied to a graph G with n nodes and chromatic number 3, the method yields a 2-colouring of the vertices such that no triangle is monochromatic in expected time O(n4).

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 2 , Issue 3 , September 1993 , pp. 363 - 365
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Donnelly, P. and Welsh, D. J. A. (1983) Finite particle systems and infection models. Math. Proc. Cambridge Philosophical Society 94 167–182.CrossRefGoogle Scholar
[2]Donnelly, P. and Welsh, D. J. A. (1984) The antivoter problem: random 2-colourings of graphs. In: Bollobás, B. (ed.) Graph Theory and Combinatorics, Proc. Conference in honour of Paul Erdőos, Cambridge, 1983, Academic Press, 133–144.Google Scholar
[3]Feller, W. (1968) An Introduction to Probability Theory and its Applications, Volume 1, 3rd edition, Wiley, New York.Google Scholar
[4]Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability, W.H. Freeman & Co, San Francisco.Google Scholar
[5]Khanna, S., Linial, N. and Safra, S. (1993) On the hardness of approximating the chromatic number. (Manuscript.)Google Scholar
[6]Lovász, L. (1973) Coverings and colorings of hypergraphs. Proc. 4th S.E. Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica Publishing, Winnipeg, 3–12.Google Scholar
[7]Petford, A. D. and Welsh, D. J. A. (1989) A randomised 3-colouring algorithm. Discrete Mathematics 74 253–261.CrossRefGoogle Scholar
[8]Žerovnik, J. (1987) A randomised heuristical algorithm for graph colouring. Proc. 8th Yugoslav Seminar on Graph Theory, Novi Sad.Google Scholar