Jump to ContentJump to Main Navigation
Random Tensors$
Users without a subscription are not able to see the full content.

Răzvan Gheorghe Gurău

Print publication date: 2016

Print ISBN-13: 9780198787938

Published to Oxford Scholarship Online: January 2017

DOI: 10.1093/acprof:oso/9780198787938.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 24 June 2019

The classification of edge colored graphs

The classification of edge colored graphs

(p.49) Chapter 4 The classification of edge colored graphs
Random Tensors

Razvan Gurau

Oxford University Press

This chapter presents the classification of the edge colored graphs by the degree. It is well known that the family of combinatorial maps of fixed genus is infinite and exponentially bounded. It turns out that the same holds for edge colored graphs, where the degree plays the role of the genus: the family of graphs of fixed degree is infinite and exponentially bounded. The graphs at fixed degree are enumerated explicitly, and the generating function of the family of graphs of fixed degree is computed.

Keywords:   enumeration of graphs, edge colored graphs, generating function

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .