**by Edward Scheinerman, Daniel Ullman**

DescriptionTable of ContentsDetailsHashtagsReport an issue ### Book Description

A unified treatment of the most important results in the study of fractional graph concepts, this volume explores the various ways in which integer-valued concepts can be modified to derive nonintegral values. It begins with the general fractional theory of hypergraphs and presents in-depth coverage of fundamental and advanced topics. Subjects include fractional matching, fractional coloring, fractional edge coloring, fractional arboricity via matroid methods, and fractional isomorphism. The final chapter examines additional topics such as fractional domination, fractional intersection numbers, and fractional aspects of partially ordered sets.

Challenging exercises reinforce the contents of each chapter, and the authors provide substantial references and bibliographic materials. A comprehensive reference for researchers, this volume also constitutes an excellent graduate-level text for students of graph theory and linear programming. ### Table of Contents

### Book Details

### Related Books

Challenging exercises reinforce the contents of each chapter, and the authors provide substantial references and bibliographic materials. A comprehensive reference for researchers, this volume also constitutes an excellent graduate-level text for students of graph theory and linear programming.

This open book is licensed under a Open Publication License (OPL). You can download Fractional Graph Theory ebook for free in PDF format (1.3 MB).

Chapter 1

General Theory: Hypergraphs

Chapter 2

Fractional Matching

Chapter 3

Fractional Coloring

Chapter 4

Fractional Edge Coloring

Chapter 5

Fractional Arboricity and Matroid Methods

Chapter 6

Fractional Isomorphism

Chapter 7

Fractional Odds and Ends

Publisher

John Wiley & Sons

Published

2013

Pages

167

Edition

1

Language

English

ISBN13 Digital

9780486292137

ISBN10 Digital

0486292134

PDF Size

1.3 MB

License

Open Publication License

This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software....

Neo4j is the world's leading graph database and offers users a radical new way of dealing with connected data. This book has been created to help you get to grips with it, providing you with an accessible route through a tool built to contend with the complexity of modern data. Learn the fundamental concepts behind Neo4j, and put them into practice...

This book constitutes the proceedings of the 15th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2012, held as part of the joint European Conference on Theory and Practice of Software, ETAPS 2012, which took place in Tallinn, Estonia, in March/April 2012.
The 29 papers presented in this book toget...

This book constitutes the proceedings of the 21st International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2018, which took place in Thessaloniki, Greece, in April 2018, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2018.The 31 papers presented in this volume were ca...

Discover how graph databases can help you manage and query highly connected data. With this practical book, you'll learn how to design and implement a graph database that brings the power of graphs to bear on a broad range of problem domains. Whether you want to speed up your response to user queries or build a database that can adapt as your busin...

Applied Combinatorics is an open-source book for a course covering the fundamental enumeration techniques (permutations, combinations, subsets, pigeon hole principle), recursion and mathematical induction, more advanced enumeration techniques (inclusion-exclusion, generating functions, recurrence relations, Polyá theory), discrete structures (grap...