# Michael Capobianco's Examples and counterexamples in graph theory PDF

By Michael Capobianco

ISBN-10: 0444002553

ISBN-13: 9780444002556

Similar graph theory books

Jean-Claude Fournier's Graph Theory and Applications: With Exercises and Problems PDF

Content material: bankruptcy 1 uncomplicated strategies (pages 21–43): bankruptcy 2 bushes (pages 45–69): bankruptcy three colors (pages 71–82): bankruptcy four Directed Graphs (pages 83–96): bankruptcy five seek Algorithms (pages 97–118): bankruptcy 6 optimum Paths (pages 119–147): bankruptcy 7 Matchings (pages 149–172): bankruptcy eight Flows (pages 173–195): bankruptcy nine Euler excursions (pages 197–213): bankruptcy 10 Hamilton Cycles (pages 26–236): bankruptcy eleven Planar Representations (pages 237–245): bankruptcy 12 issues of reviews (pages 247–259): bankruptcy A Expression of Algorithms (pages 261–265): bankruptcy B Bases of Complexity concept (pages 267–276):

Within the spectrum of arithmetic, graph conception which reviews a mathe­ matical constitution on a suite of components with a binary relation, as a well-known self-discipline, is a relative newcomer. In fresh 3 many years the fascinating and swiftly growing to be zone of the topic abounds with new mathematical devel­ opments and critical functions to real-world difficulties.

Additional resources for Examples and counterexamples in graph theory

Sample text

Assume a 1-factor F contains x. Then F cannot contain z. Then the set S = {v2, v3 , v4, v5, v6} cannot be covered by the lines of F, since S contains an odd number of points. In 1 89 1 J. Petersen showed that every cubic graph which does not have a 1-factor must have at least three bridges. He also proved that every bridgeless cubic graph is the line-disjoint union of a } factor and a 2-factor. We have, however, the following example. 22 Not every bridgeless cubic graph is 1-jactorab/e. 1 .. We shall refer to the v t v 2 v 3 v4 v� v • cycle as the outer cycle, the v 1 v9 v6 v8 Vto v1 cycle as the inner cycle, and the remaining lines as the connecting lines.

The graph on the left is the one given by the construction described above. 63 THEOREM The maximum number of edges in a connected graph of order p and external stability aoo > 3 is (p-1'+1 ) (Vijayaditya 1968a). An extremal graph can be constructed as follows. Note first that connectedness implies p � 2a00• Now take a complete graph of order p - aoo and join each of its vertices to one of a00 new ones taking care that the graph is connected. We illustrate below for the case p = 7, a00 = 3. 64 THEOREM The minimum number of edges in a graph of order p and external stability a00 is p - a00• A ny such extremal graph consists of a00 disjoint stars (including K2 and K1 as possible stars).

The first problem of this type which one generally encounters is the determination of r(K3, K3). This turns out to be 6. That 5 is too small is shown by the 5-cycle Cs. ) The remainder of this section will be devoted to examples of the above type. For various fi and Fi, graphs G of order one less than r(Fi , F; ) will be given which do not contain fi and whose complements do not contain Fi. It is of interest to note that the determination of Ramsey numbers even in the case of complete graphs is still an unsolved problem.