Jump to ContentJump to Main Navigation
The Fascinating World of Graph Theory$
Users without a subscription are not able to see the full content.

Ping Zhang, Gary Chartrand, and Arthur Benjamin

Print publication date: 2017

Print ISBN-13: 9780691175638

Published to Princeton Scholarship Online: May 2018

DOI: 10.23943/princeton/9780691175638.001.0001

Show Summary Details
Page of

PRINTED FROM PRINCETON SCHOLARSHIP ONLINE (www.princeton.universitypressscholarship.com). (c) Copyright Princeton University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in PRSO for personal use.date: 04 June 2020

Factoring Graphs

Factoring Graphs

Chapter:
(p.125) 7 Factoring Graphs
Source:
The Fascinating World of Graph Theory
Author(s):

Arthur Benjamin

Gary Chartrand

Ping Zhang

Publisher:
Princeton University Press
DOI:10.23943/princeton/9780691175638.003.0007

This chapter focuses on Hall's Theorem, introduced by British mathematician Philip Hall, and its connection to graph theory. It first considers problems that ask whether some collection of objects can be matched in some way to another collection of objects, with particular emphasis on how different types of schedulings are possible using a graph. It then examines one popular version of Hall's work, a statement known as the Marriage Theorem, the occurrence of matchings in bipartite graphs, Tutte's Theorem, Petersen's Theorem, and the Petersen graph. Peter Christian Julius Petersen introduced the Petersen graph to show that a cubic bridgeless graph need not be 1-factorable. The chapter concludes with an analysis of 1-factorable graphs, the 1-Factorization Conjecture, and 2-factorable graphs.

Keywords:   Hall's Theorem, Marriage Theorem, bipartite graph, Tutte's Theorem, Petersen's Theorem, Petersen graph, 1-factorable graph, 1-Factorization Conjecture, 2-factorable graph

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