On Sets and Graphs

DOI10.1007/978-3-319-54981-1zbMath1382.05002OpenAlexW4252514983MaRDI QIDQ5360855

Alberto Policriti, Alexandru I. Tomescu, Eugenio Giovanni Omodeo

Publication date: 26 September 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-54981-1

zbMATH Keywords

setscomputational complexityMarkov chainNP-completenessHamiltonian cycledirected graphsblock graphsNP-hardnessHamiltonian pathacyclic orientationsclaw-free graphsundirected graphswell-orderingchoice axiomset graphshypersetsinfinitiesproof checkerhereditary finite setsAckermann encodingextensionalizationsmembership graphsRefereeZermelo-Frankel axioms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Applications of set theory (03E75) Other combinatorial set theory (03E05) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Infinite graphs (05C63)

Related Items (5)

Unnamed Item ⋮ Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership ⋮ Adding the power-set to description logics ⋮ Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* ⋮ Unnamed Item

This page was built for publication: On Sets and Graphs