Compactness and finite equivalence of infinite digraphs

DOI10.1016/S0012-365X(96)00220-8zbMath0878.05038MaRDI QIDQ1356449

Bruce L. Bauslaugh

Publication date: 18 December 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

compactnesshomomorphisminfinite digraphfinite equivalencecompact digraphshomomorphic equivalence

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Models with special properties (saturated, rigid, etc.) (03C50)

Cites Work

• Unnamed Item
• On multiplicative graphs and the product conjecture
• Cores and compactness of infinite directed graphs
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Core-like properties of infinite graphs and structures
• Lattices arising in categorial investigations of Hedetniemi's conjecture
• Graph Theory and Probability
• A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• The axiom of choice