Elementary submodels in infinite combinatorics

DOI10.1016/j.disc.2011.01.025zbMath1408.05110arXiv1007.4309OpenAlexW2121185728MaRDI QIDQ2275385

Lajos Soukup

Publication date: 8 August 2011

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

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

zbMATH Keywords

decompositioninfinite graphscycle decompositionpartition theoremelementary submodelsFodor's lemmafree subsetpressing down lemma\(\varDelta \)-systembond-faithful decompositiondouble cover conjecture

Mathematics Subject Classification ID

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

Related Items

Quickly proving Diestel's normal spanning tree criterion ⋮ \(T\)-joins in infinite graphs ⋮ Disjoint dijoins for classes of dicuts in finite and infinite digraphs ⋮ Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II ⋮ The Lovász-Cherkassky theorem in countable graphs ⋮ Reducing the dichromatic number via cycle reversions in infinite digraphs ⋮ On Partitioning the Edges of an Infinite Digraph into Directed Cycles ⋮ A Cantor-Bernstein-type theorem for spanning trees in infinite graphs ⋮ INFINITE COMBINATORICS PLAIN AND SIMPLE ⋮ Maximum deconstructibility in module categories

Cites Work

• Set theory. An introduction to independence proofs
• Applications of elementary submodels in general topology
• Decompositions of infinite graphs. I: Bond-faithful decompositions
• Cardinal Arithmetic
• Decomposition of Graphs Into Closed and Endless Chains
• Forcing constructions for uncountably chromatic graphs
• Set Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item