On universal positive graphs

DOI10.1134/S003744662301010XMaRDI QIDQ2687461FDOQ2687461

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

Publication date: 2 March 2023

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

Recommendations

• The complexity of a class of infinite graphs
• Some universal graphs
• On the existence of countable universal graphs
• Universal graphs without large bipartite subgraphs
• Some remarks on universal graphs

zbMATH Keywords

computable numberingcomputable reducibilitycomputably enumerable relationpositive graph

Mathematics Subject Classification ID

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

Cites Work

• Efficient Planarity Testing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Turing computability. Theory and applications
• Title not available (Why is that?)
• Straight Line Representations of Infinite Planar Graphs
• Finitely axiomatizable quasivarieties of graphs
• Positive equivalences
• Classifying positive equivalence relations
• Computably enumerable equivalence relations
• Fastplättbare Graphen
• On isomorphism classes of computably enumerable equivalence relations
• Universally axiomatizable subclasses of locally finite classes of models
• Positive preorders
• Special classes of positive preorders
• On dark computably enumerable equivalence relations
• Weakly precomplete computably enumerable equivalence relations
• Universal computably enumerable equivalence relations
• A survey on universal computably enumerable equivalence relations
• The theory of ceers computes true arithmetic
• The structure of computably enumerable preorder relations
• Joins and meets in the structure of ceers
• Graph Coloring and Reverse Mathematics

Cited In (1)

• Positive Fork Graph Calculus

This page was built for publication: On universal positive graphs

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