Elementary submodels in infinite combinatorics

DOI10.1016/J.DISC.2011.01.025zbMATH Open1408.05110arXiv1007.4309OpenAlexW2121185728MaRDI QIDQ2275385FDOQ2275385

Authors: Lajos Soukup 

Publication date: 8 August 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/1007.4309

Recommendations

• Infinite combinatorics plain and simple
• The use of elementary substructures in combinatorics
• scientific article; zbMATH DE number 863511
• The Lindelöf number of a power; an introduction to the use of elementary submodels in general topology
• scientific article; zbMATH DE number 488248

zbMATH Keywords

decompositioninfinite graphspartition theoremcycle decompositionelementary submodelsFodor's lemmafree subsetpressing down lemma\(\varDelta \)-systembond-faithful decompositiondouble cover conjecture

Mathematics Subject Classification ID

Infinite graphs (05C63) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Set theory. An introduction to independence proofs
• Set Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cardinal Arithmetic
• Title not available (Why is that?)
• Forcing constructions for uncountably chromatic graphs
• Decompositions of infinite graphs. I: Bond-faithful decompositions
• Decomposition of Graphs Into Closed and Endless Chains
• Applications of elementary submodels in general topology

Cited In (16)

• Quickly proving Diestel's normal spanning tree criterion
• Reducing the dichromatic number via cycle reversions in infinite digraphs
• \(T\)-joins in infinite graphs
• On the Number of Elementary Submodels of an Unsuperstable Homogeneous Structure
• Infinite combinatorics plain and simple
• On partitioning the edges of an infinite digraph into directed cycles
• Maximum deconstructibility in module categories
• Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
• Some combinatorial principles defined in terms of elementary submodels
• The uniform convergence topology on separable subsets
• Disjoint dijoins for classes of dicuts in finite and infinite digraphs
• The Lovász-Cherkassky theorem in infinite graphs
• The use of elementary substructures in combinatorics
• Combinatorics for the East model
• A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
• The Lovász-Cherkassky theorem in countable graphs

This page was built for publication: Elementary submodels in infinite combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275385)