A rigid graph for every set

DOI10.1002/JGT.10013zbMATH Open1002.05068OpenAlexW4252791140MaRDI QIDQ4534210FDOQ4534210

Authors: J. Nešetřil 

Publication date: 5 June 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10013

zbMATH Keywords

rigid graph

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Relations (graphs) with given infinite semigroups
• How comprehensive is the category of semigroups?

Cited In (2)

• On the order of countable graphs
• A surprising permanence of old motivations (a not-so-rigid story)

This page was built for publication: A rigid graph for every set

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