We define the (elementary) binary contraction Gs of a graph G = (V, E) in the following way: if (S) is an induced K,,, not contained into an induced Klv3, then Gs is either the induced subgraph (V\ S), or the graph obtained from (V\S) by adding a new vertex adjacent to those x E V\S such that (S U(x
Reverse binary graphs
β Scribed by Sajal K Das; Narsingh Deo; Sushil Prasad
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 889 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We analyze three applications of Ramseyβs Theorem for 4βtuples to infinite traceable graphs and finitely generated infinite lattices using the tools of reverse mathematics. The applications in graph theory are shown to be equivalent to Ramseyβs Theorem while the application in lattice t
The relationship of Grundy and chromatic numbers of graphs in the context of Reverse Mathematics is investigated.
In hopes of better understanding graph-theoretic duality, a syntactical 'duality principle' is proved for circuit-cutset duality in binary matroids. The principle is shown to characterize binarity, and its theoretical and practicat applicability is discussed.