Author:
LIEBY PAULETTE,McKAY BRENDAN D.,McLEOD JEANETTE C.,WANLESS IAN M.
Abstract
LetG=G(n) be a randomly chosenk-edge-colouredk-regular graph with 2nvertices, wherek=k(n). Such a graph can be obtained from a random set ofkedge-disjoint perfect matchings ofK2n. Leth=h(n) be a graph withm=m(n) edges such thatm2+mk=o(n). Using a switching argument, we find an asymptotic estimate of the expected number of subgraphs ofGisomorphic toh. 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 ofk-edge-colouredk-regular graphs fork=o(n5/6) is found.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference13 articles.
1. Short cycles in random regular graphs;McKay;Electron. J. Combin.,2004
2. Asymptotic enumeration by degree sequence of graphs with degreeso(n 1/2)
3. [11] McLeod J. C. Asymptotic enumeration of k-edge-coloured k-regular graphs. Submitted.
4. Extending matchings in graphs: A survey
5. Subgraphs of random graphs with specified degrees;McKay;Congr. Numer.,1981
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献