On universal positive graphs

DOI10.1134/S003744662301010XMaRDI QIDQ2687461

B. S. Kalmurzayev, D. B. Alish, Nikolay Bazhenov

Publication date: 2 March 2023

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

computable numberingcomputable reducibilitycomputably enumerable relationpositive graph

Mathematics Subject Classification ID

Graph theory (05Cxx) Proof theory and constructive mathematics (03Fxx) Computability and recursion theory (03Dxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positive equivalences
• On dark computably enumerable equivalence relations
• Positive preorders
• Finitely axiomatizable quasivarieties of graphs
• Special classes of positive preorders
• The theory of ceers computes true arithmetic
• The structure of computably enumerable preorder relations
• Universally axiomatizable subclasses of locally finite classes of models
• Weakly precomplete computably enumerable equivalence relations
• Turing Computability
• UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• A Survey on Universal Computably Enumerable Equivalence Relations
• Classifying positive equivalence relations
• Efficient Planarity Testing
• Straight Line Representations of Infinite Planar Graphs
• Graph Coloring and Reverse Mathematics
• ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• Joins and meets in the structure of ceers
• Fastplättbare Graphen
• Computably enumerable equivalence relations

This page was built for publication: On universal positive graphs