By Cai M.-C., Favaron O., Li H.

Show description

Read or Download (2,k)-Factor-Critical Graphs and Toughness PDF

Best graph theory books

Discrete Mathematics: Elementary and Beyond (Undergraduate Texts in Mathematics)

Discrete arithmetic is readily changing into some of the most very important parts of mathematical study, with purposes to cryptography, linear programming, coding conception and the idea of computing. This ebook is aimed toward undergraduate arithmetic and desktop technological know-how scholars attracted to constructing a sense for what arithmetic is all approximately, the place arithmetic might be valuable, and what forms of questions mathematicians paintings on.

Reasoning and Unification over Conceptual Graphs

Reasoning and Unification over Conceptual Graphs is an exploration of computerized reasoning and determination within the increasing box of Conceptual constructions. Designed not just for computing scientists gaining knowledge of Conceptual Graphs, but additionally for somebody attracted to exploring the layout of data bases, the publication explores what are proving to be the elemental tools for representing semantic family in wisdom bases.

Encyclopedia of Distances

This up to date and revised moment variation of the best reference quantity on distance metrics incorporates a wealth of recent fabric that displays advances in a box now considered as a necessary software in lots of components of natural and utilized arithmetic. The ebook of this quantity coincides with intensifying learn efforts into metric areas and particularly distance layout for purposes.

Additional resources for (2,k)-Factor-Critical Graphs and Toughness

Sample text

32 B. Bollobas, P. Erdos M . Simonovits, E. Szemeridi (iv) Let Bibe the set of vertices in Ai joined to at least cn vertices of the same class Ai. Then lBil< M. Proof. Let M,, = R and choose natural numbers M , < M2<. Put M = Md. Pick q such that 0 < q < (tc)". By Lemma 5 (ii) we can choose E , 0 < E < c, and n, such that if N = [ q n ] ,n 2 n , and in H = Gd(N,N , . . , N ) at most &n2 edges are missing between any two classes then H contains a Kd(R,R, . . , R). 2 in [I]) implies that there exist noZ n , and 6 > 0 with the following properties.

Xn-19 ~ i - 1 xn)(xn, , Y:, where i = 1 , 2 , . . , i ( n - 2 ) ; y j f y‘; for i f k and where the set { y i : i = 1 , 2 , . . ,b(n - 2) is determined as follows. Consider the $(n- 2) elements representative of the triples (x,, x,+,, y ) containing the pair {x,, x,,,} and where neither x, nor x , , ~ has been chosen. Then split these elements into two sets of x,+,) and Y’{x,, x,+,l. Then the set {y; : i = 1 , 2 , . . ,% ( n -2)} cardinality i(n - 2) : YIx,, is either the set YiX, x,+,l or Y’{x,, x,+,l according as the arc (x,, x,,,) or the arc (x,,,, x l ) appears in the directed hamiltonian cycle.

Heydemann and D. Sotteau, Hypergraphes hamiltoniens, in: Coll. Int. , Problbmes Combinatoires et Th6orie des Graphes, Orsay, 1976. [8] J. D. Keedwell, Latin squares and their applications, (Akademiai Kiado, Budapest and English University Press, London, 1974). [9] C. Huang and A. Rosa, On sets of orthogonal hamiltonian circuits, Proc. 2nd Manitoba Conference on Numerical Mathematics, Utilitas Math. Congressus Numerantium VII (1972), 327-332. D. Keedwell, Some problems concerning complete latin squares, Combinatorin, Proc.

Download PDF sample

Rated 4.43 of 5 – based on 12 votes