Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 2Utilitas Mathematica Pub - Combinatorial analysis |
From inside the book
Results 1-3 of 43
Page 26
... subsets of a countably infinite set S are r - colored then there is an infinite subset S C S such that all k - subsets of S have one color . We shall return to the topic of infinite versions of Ramsey and Schur theorems at the end of ...
... subsets of a countably infinite set S are r - colored then there is an infinite subset S C S such that all k - subsets of S have one color . We shall return to the topic of infinite versions of Ramsey and Schur theorems at the end of ...
Page 36
... subsets of S all of whose ( nonempty ) unions have one color ? What if all subsets of S are colored and elements of J are allowed It has been noted by Sanders and others to be infinite ? that if the requirement of disjointness for ...
... subsets of S all of whose ( nonempty ) unions have one color ? What if all subsets of S are colored and elements of J are allowed It has been noted by Sanders and others to be infinite ? that if the requirement of disjointness for ...
Page 388
... subsets of E called independent sets , such that : 11. Every subset of an independent set is independent . 12. For every Ac E , all maximal independent subsets of A have the same cardinality , called the rank , r ( A ) of A. Let N be a ...
... subsets of E called independent sets , such that : 11. Every subset of an independent set is independent . 12. For every Ac E , all maximal independent subsets of A have the same cardinality , called the rank , r ( A ) of A. Let N be a ...
Other editions - View all
Common terms and phrases
A₁ adjacent algorithm Amer array BIBD block Canad cardinality cells characterization circuit co-circuit color Combinatorial conjecture connected matroid construction contains Corollary cycle d-arrangement D₁ defined deleting denote diagonal steps Dirac disjoint distinct eigenvalues elements equation equivalence class F-decomposition finite follows G and H G₁ Geller given graph G Graph Theory Graphen H is flexible Harary Hence induction integer isomorphic K₂ left-decap Lemma Let G Let H line graph loops M-circuit Math matrix minimally 2-connected graphs minimally strong digraphs n-colorable number of paths obtained odd degreed P-design pair pairwise balanced design pancyclic partition planar graph plane points positive integers Proof Proposition pseudographs Room square Schur theorem simple path simple path insertions spline Steiner triple systems subarray subgraphs subset Suppose symmetric symmetric difference Theorem University of Waterloo values vertex vertices W. T. Tutte weighted lattice paths zonotopes