Ordinals and graph decompositions

DOI10.1016/j.apal.2016.10.016zbMath1422.03060OpenAlexW2540338994MaRDI QIDQ508830

Stephen Flood

Publication date: 8 February 2017

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2016.10.016

zbMATH Keywords

ordinallengthgraph decompositionsimplicial decomposition

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Complexity of computation (including implicit computational complexity) (03D15) Applications of computability and recursion theory (03D80) Other applications of logic (03B80) Infinite graphs (05C63)

Cites Work

• On the strength of König's duality theorem for infinite bipartite graphs
• On the strength of König's duality theorem for countable bipartite graphs
• Set Theory
• Reverse mathematics and a Ramsey-type König's Lemma
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ordinals and graph decompositions