Titlebook: One-Factorizations; W. D. Wallis Book 1997 Springer Science+Business Media Dordrecht 1997 Matching.graph theory.graphs.mathematics.combina

chassis

Tournament Applications of One-Factorizations,an edge . representing a game between teams . and .. We shall refer to such a league — where two participants meet in each game — as a .. (The word “tournament” is also used for the directed graphs derived from this model by directing the edge from winner to loser, but we shall not consider the resu

长处

Graphs without One-Factors,he component is at most .. This means that the sum of the degrees of these . vertices in . — . is at most .(. — 1). But in . each vertex has degree ., so the sum of the degrees of the . vertices is ., whence the number of edges joining the component to . must be at least . — .(. — 1). For fixed . an

fixed-joint

Edge-Colorings,to {1, 2, ..., .}, with the property that if . and . are edges with a common vertex then .(.)≠ .(.) is .-edge-colorable if there is a .-edgecoloring of .; the edge-chromatic number .′(.) of . is the smallest number . such that . is .-edge-colorable. .′(.) is also called the . of ..

exclusice

One-Factorizations and Triple Systems, . from a .-set so that any element belongs to precisely . of the sets and any two elements commonly belong to λ of them. The .-sets are called .. It is easy to see that these parameters are not independent — in fact, .(. — 1) = λ(. — 1) and . = . — and that the constancy of . is implied by the cons

EWER

Starters,center. This arrangement is shown in Figure 10.1, with the vertices labelled {∞,0, 1,... 2. − 2}. The one-factor .. is shown in that Figure. .. is constructed by rotating .. through one-(2. − 2)th part of a revolution, clockwise, and subsequent factors are obtained in the same way. It is easy to see

使成整体

不法行为

Subfactorizations and Asymptotic Numbers of One-Factorizations,ces. It may be, however, that for every ., . ⋂ .. consists either only of edges or only of vertices; in other words each . ⋂ .. either is a one-factor of . or has edge-set ∅. If this occurs, order the .. so that . ⋂ .., . ⋂ .., ..., . ⋂ .. are one-factors in ., while . ⋂ .. has no edges for . > .. T

不遵守

Maximal Sets of Factors,factor compatible with them. A one-factorization is trivially a maximal set; a maximal set of fewer than . one-factors in a regular graph of degree . will be called .. Theorem 8.3 essentially tells us that .. has no proper maximal set (see Theorem 18.13, below). It is natural to ask about the existe

etidronate

Mathematics and Its Applicationshttp://image.papertrans.cn/o/image/701473.jpg

Decibel

https://doi.org/10.1007/978-1-4757-2564-3Matching; graph theory; graphs; mathematics; combinatorics