Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-28T00:15:46.768Z Has data issue: false hasContentIssue false
  • English
  • Français

Subgraphs of Random k-Edge-Coloured k-Regular Graphs

Published online by Cambridge University Press:  01 July 2009

PAULETTE LIEBY ,
BRENDAN D. McKAY ,
JEANETTE C. McLEOD  and
IAN M. WANLESS
PAULETTE LIEBY
Affiliation:
National ICT Australia, Canberra Research Laboratory, Locked Bag 8001, Canberra ACT 2601, Australia (e-mail: paulette.lieby@rsise.anu.edu.au)
BRENDAN D. McKAY
Affiliation:
School of Computer Science, Australian National University, Canberra ACT 0200, Australia (e-mail: bdm@cs.anu.edu.au)
JEANETTE C. McLEOD
Affiliation:
Heilbronn Institute, Department of Mathematics, University of Bristol, Bristol BS8 1TH, UK (e-mail: jeanette.mcleod@bristol.ac.uk)
IAN M. WANLESS
Affiliation:
School of Mathematical Sciences, Monash University, Vic 3800, Australia (e-mail: ian.wanless@sci.monash.edu.au)
Get access Rights & Permissions [Opens in a new window]

Abstract

Let G = G(n) be a randomly chosen k-edge-coloured k-regular graph with 2n vertices, where k = k(n). Such a graph can be obtained from a random set of k edge-disjoint perfect matchings of K2n. Let h = h(n) be a graph with m = m(n) edges such that m2 + mk = o(n). Using a switching argument, we find an asymptotic estimate of the expected number of subgraphs of G isomorphic to h. Isomorphisms may or may not respect the edge colouring, and other generalizations are also presented. Special attention is paid to matchings and cycles.

The results in this paper are essential to a forthcoming paper of McLeod in which an asymptotic estimate for the number of k-edge-coloured k-regular graphs for k = o(n5/6) is found.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 18 , Issue 4 , July 2009 , pp. 533 - 549
Copyright
Copyright © Cambridge University Press 2009

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.)

References

[1]Bollobás, B. (1981) Random graphs. In Combinatorics, Vol. 52 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 80–102.CrossRefGoogle Scholar
[2]Bollobás, B. (2001) Random Graphs, Vol. 73 of Cambridge Studies in Advanced Mathematics, Cambridge University Press.Google Scholar
[3]Bollobás, B. and McKay, B. D. (1986) The number of matchings in random regular graphs and bipartite graphs. J. Combin. Theory Ser. B 41 80–91.CrossRefGoogle Scholar
[4]Godsil, C. D. (1981) Hermite polynomials and a duality relation for the matchings polynomial. Combinatorica 1 137–144.CrossRefGoogle Scholar
[5]Greenhill, C., McKay, B. D. and Wang, X. (2006) Asymptotic enumeration of sparse 0–1 matrices with irregular row and column sums. J. Combin. Theory Ser. A 113 291–324.CrossRefGoogle Scholar
[6]McKay, B. D. (1981) Subgraphs of random graphs with specified degrees. Congr. Numer. 33 213–323.Google Scholar
[7]McKay, B. D. (1985) Asymptotics for symmetric 0–1 matrices with prescribed row sums. Ars Combin. 19A 15–26.Google Scholar
[8]McKay, B. D. and Wormald, N. C. (1990) Uniform generation of random regular graphs of moderate degree. J. Algorithms 11 52–67.CrossRefGoogle Scholar
[9]McKay, B. D. and Wormald, N. C. (1991) Asymptotic enumeration by degree sequence of graphs with degrees o(n 1/2). Combinatorica 11 369–382.CrossRefGoogle Scholar
[10]McKay, B. D., Wormald, N. C. and Wysocka, B. (2004) Short cycles in random regular graphs. Electron. J. Combin. 11 R66.CrossRefGoogle Scholar
[11]McLeod, J. C. Asymptotic enumeration of k-edge-coloured k-regular graphs. Submitted.Google Scholar
[12]Plummer, M. D. (1994) Extending matchings in graphs: A survey. Discrete Math. 127 277–292.CrossRefGoogle Scholar
[13]Wormald, N. C. (1999) Models of random regular graphs. In Surveys in Combinatorics 1999, Vol. 267 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 239–298.CrossRefGoogle Scholar