Elementary submodels in infinite combinatorics - Mathematics > LogicReport as inadecuate




Elementary submodels in infinite combinatorics - Mathematics > Logic - Download this document for free, or read online. Document in PDF available to download.

Abstract: The usage of elementary submodels is a simple but powerful method to provetheorems, or to simplify proofs in infinite combinatorics. First we introduceall the necessary concepts of logic, then we prove classical theorems usingelementary submodels. We also present a new proof of Nash-Williams-s theorem oncycle-decomposition of graphs, and finally we improve a decomposition theoremof Laviolette concerning bond-faithful decompositions of graphs.



Author: Lajos Soukup

Source: https://arxiv.org/







Related documents