Muutke küpsiste eelistusi

Fractional Graph Theory: A Rational Approach to the Theory of Graphs [Kõva köide]

Teised raamatud teemal:
Teised raamatud teemal:
Explores the various ways in which integer-valued graph theory concepts can be modified to derive nonintegral values. Based on the authors' review of the literature, this graduate-text for students of graph theory and linear programming begins by developing a general fractional theory of hypergraphs. Then fundamental and advanced topics are covered, including fractional matching and coloring and fractional isomorphism. The final chapter covers issues such as fractional topological graph theory, cycle double covers, denomination, and aspects of partially ordered sets. Annotation c. by Book News, Inc., Portland, Or.

"Both authors are excellent expositors-exceptionally so-and this makes for a pleasurable read and allows for clear understanding of the mathematical concepts." -Joel Spencer Fractional Graph Theory explores the various ways in which integer-valued graph theory concepts can be modified to derive nonintegral values. Based on the authors' extensive review of the literature, it provides a unified treatment of the most important results in the study of fractional graph concepts. Professors Scheinerman and Ullman begin by developing a general fractional theory of hypergraphs and move on to provide in-depth coverage of fundamental and advanced topics, including fractional matching, fractional coloring, and fractional edge coloring; fractional arboricity via matroid methods; and fractional isomorphism. The final chapter is devoted to a variety of additional issues, such as fractional topological graph theory, fractional cycle double covers, fractional domination, fractional intersection number, and fractional aspects of partially ordered sets. Supplemented with many challenging exercises in each chapter as well as an abundance of references and bibliographic material, Fractional Graph Theory is a comprehensive reference for researchers and an excellent graduate-level text for students of graph theory and linear programming.
Foreword xi(2)
Preface xiii
1 General Theory: Hypergraphs
1(18)
1.1 Hypergraph covering and packing
2(1)
1.2 Fractional covering and packing
3(2)
1.3 Some consequences
5(2)
1.4 A game-theoretic approach
7(1)
1.5 Duality and duality
8(2)
1.6 Asymptotic covering and packing
10(6)
1.7 Exercises
16(1)
1.8 Notes
17(2)
2 Fractional Matching
19(22)
2.1 Introduction
19(5)
2.2 Results on maximum fractional matchings
24(5)
2.3 Fractionally Hamiltonian graphs
29(7)
2.4 Computational complexity
36(1)
2.5 Exercises
37(2)
2.6 Notes
39(2)
3 Fractional Coloring
41(36)
3.1 Definitions
41(2)
3.2 Homomorphisms and the Kneser graphs
43(5)
3.3 The duality gap
48(4)
3.4 Graph products
52(4)
3.5 The asymptotic chromatic and clique numbers
56(3)
3.6 The fractional chromatic number of the plane
59(7)
3.7 The Erdos-Faber-Lovasz conjecture
66(3)
3.8 List coloring
69(2)
3.9 Computational complexity
71(1)
3.10 Exercises
72(3)
3.11 Notes
75(2)
4 Fractional Edge Coloring
77(22)
4.1 Introduction
77(2)
4.2 An exact formula
79(1)
4.3 The matching polytope
80(3)
4.4 Proof and consequences
83(3)
4.5 Computational complexity
86(1)
4.6 Fractional total chromatic number
87(8)
4.7 Exercises
95(2)
4.8 Notes
97(2)
5 Fractional Arboricity and Matroid Methods
99(28)
5.1 Arboricity and maximum average degree
99(2)
5.2 Matroid theoretic tools
101(5)
5.3 Matroid partitioning
106(6)
5.4 Arboricity again
112(3)
5.5 Maximum average degree again
115(2)
5.6 Duality, duality, duality and edge toughness
117(7)
5.7 Exercises
124(2)
5.8 Notes
126(1)
6 Fractional Isomorphism
127(25)
6.1 Relaxing isomorphism
127(5)
6.2 Linear algebra tools
132(5)
6.3 Equitable partitions
137(2)
6.4 Interated degree sequences
139(1)
6.5 The main theorem
140(4)
6.6 Other relaxations of isomorphism
144(4)
6.7 Exercises
148(2)
6.8 Notes
150(2)
7 Fractional Odds and Ends
152(28)
7.1 Fractional topological graph theory
152(3)
7.2 Fractional cycle double covers
155(2)
7.3 Fractional Ramsey theory
157(3)
7.4 Fractional domination
160(7)
7.5 Fractional intersection number
167(5)
7.6 Fractional dimension of a poset
172(3)
7.7 Sperner's theorem: a fractional perspective
175(1)
7.8 Exercises
176(2)
7.9 Notes
178(2)
Appendix: Background 180(11)
A.1 Basic graph theory and notation 181(3)
A.2 Hypergraphs, multigraphs, multisets, fuzzy sets 184(1)
A.3 Linear programming 185(3)
A.4 The subadditivity lemma 188(2)
A.5 Exercises 190(1)
A.6 Notes 190(1)
Bibliography 191(12)
Author Index 203(4)
Subject Index 207


EDWARD R. SCHEINERMAN, PhD, is a professor in the Department of Mathematical Sciences at The Johns Hopkins University. DANIEL H. ULLMAN, PhD, is an associate professor in the Department of Mathematics at The George Washington University.