Well-quasi-ordering hereditarily finite sets

DOI10.1080/00207160.2012.754434zbMATH Open1273.05091OpenAlexW2512110348MaRDI QIDQ2855754FDOQ2855754

Authors: 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

Recommendations

• Well-quasi-ordering hereditarily finite sets
• Subgraphs and well‐quasi‐ordering
• Well quasi-ordered sets
• scientific article; zbMATH DE number 4002134
• Digraph parameters and finite set arithmetic

zbMATH Keywords

subdivisionwell-quasi-orderhereditarily finite setextensional digraphhyperset

Mathematics Subject Classification ID

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

Cites Work

• Graph minors. XX: Wagner's conjecture
• Directed tree-width
• Digraph measures: Kelly decompositions, games, and orderings
• Title not available (Why is that?)
• Well-structured transition systems everywhere!
• Graph minors XXIII. Nash-Williams' immersion conjecture
• A well-quasi-order for tournaments
• A classification of the expressive power of well-structured transition systems
• Hypersets
• Decomposition of Graphs into Two-Way Infinite Paths
• Well-quasi-ordering hereditarily finite sets
• Ackermann encoding, bisimulations and OBDDs

Cited In (6)

• Title not available (Why is that?)
• Digraph parameters and finite set arithmetic
• Set graphs. II. Complexity of set graph recognition and similar problems
• Is hyper-extensionality preservable under deletions of graph elements?
• Well-quasi-ordering hereditarily finite sets
• Well‐quasi‐ordering and finite distinguishing number

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

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