Well-quasi-ordering hereditarily finite sets

DOI10.1080/00207160.2012.754434zbMath1273.05091OpenAlexW2512110348MaRDI QIDQ2855754

Alberto Policriti, Alexandru I. Tomescu

Publication date: 22 October 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.754434

zbMATH Keywords

subdivisionwell-quasi-orderhereditarily finite setextensional digraphhyperset

Mathematics Subject Classification ID

Graph minors (05C83) Directed graphs (digraphs), tournaments (05C20) Other combinatorial set theory (03E05) Sets, relations, set theory (educational aspects) (97E60)

Related Items (1)

Set graphs. II. Complexity of set graph recognition and similar problems

Cites Work

• Unnamed Item
• A classification of the expressive power of well-structured transition systems
• A well-quasi-order for tournaments
• Graph minors. XX: Wagner's conjecture
• Digraph measures: Kelly decompositions, games, and orderings
• Graph minors XXIII. Nash-Williams' immersion conjecture
• Hypersets
• Directed tree-width
• Well-Quasi-Ordering Hereditarily Finite Sets
• Ackermann encoding, bisimulations and OBDDs
• Decomposition of Graphs into Two-Way Infinite Paths
• Well-structured transition systems everywhere!

This page was built for publication: Well-quasi-ordering hereditarily finite sets