Symmetric Relations (Undirected Graphs) with Given Semigroups.
Monatshefte für Mathematik (1965)
- Volume: 69, page 318-322
- ISSN: 0026-9255; 1436-5081/e
Access Full Article
topHow to cite
topHedrlin, Z., and Pultr, A.. "Symmetric Relations (Undirected Graphs) with Given Semigroups.." Monatshefte für Mathematik 69 (1965): 318-322. <http://eudml.org/doc/177296>.
@article{Hedrlin1965,
author = {Hedrlin, Z., Pultr, A.},
journal = {Monatshefte für Mathematik},
keywords = {generalized groups, semigroups},
pages = {318-322},
title = {Symmetric Relations (Undirected Graphs) with Given Semigroups.},
url = {http://eudml.org/doc/177296},
volume = {69},
year = {1965},
}
TY - JOUR
AU - Hedrlin, Z.
AU - Pultr, A.
TI - Symmetric Relations (Undirected Graphs) with Given Semigroups.
JO - Monatshefte für Mathematik
PY - 1965
VL - 69
SP - 318
EP - 322
KW - generalized groups, semigroups
UR - http://eudml.org/doc/177296
ER -
Citations in EuDML Documents
top- Jaroslav Nešetřil, Every group is a maximal subgroup of the semigroup of relations
- Tomáš Wichs, On minimal semirigid relations
- Václav Koubek, Vojtěch Rödl, Note on the number of monoids of order
- Jaroslav Nešetřil, Infinite precise objects
- Pavol Hell, Jaroslav Nešetřil, Universality of directed graphs of a given height
- Pavel Křivka, On representations of monoids as monoids of polynomials
- Petr Vopěnka, Aleš Pultr, Zdeněk Hedrlín, A rigid relation exists on any set
- Václav Koubek, Graphs with given subgraphs represent all categories
- Jiří Adámek, Horst Herrlich, George E. Strecker, Least and largest initial completions. II.
- Aleš Pultr, On full embeddings of concrete categories with respect to forgetful functors
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.