On the minimum order of graphs with given semigroup

DOI10.1016/0095-8956(84)90021-2zbMATH Open0538.05054OpenAlexW2034331627MaRDI QIDQ793058FDOQ793058

Authors: Václav Koubek, Vojtěch Rödl 

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90021-2

Recommendations

• On graphs with a given endomorphism monoid
• On the number of graphs with a given endomorphism monoid
• REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS
• Graphs and ranks of monoids
• scientific article; zbMATH DE number 6423882

zbMATH Keywords

uniform hypergraphsendomorphism monoid

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (05C99) Representation of semigroups; actions of semigroups on sets (20M30)

Cites Work

• Some remarks on the theory of graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Title not available (Why is that?)
• Asymmetric graphs
• Title not available (Why is that?)
• On Lovász' lattice reduction and the nearest lattice point problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Subdirect unions in universal algebra
• The Number of Semigroups of Order n
• On the Minimum Order of Graphs with Given Group
• Relations (graphs) with given finitely generated semigroups
• Graphs and k-Societies
• Infinite digraphs with given regular automorphism groups

Cited In (14)

• Almost all graphs are rigid-revisited
• On the number of graphs with a given endomorphism monoid
• Endomorphism breaking in graphs
• The order of monochromatic subgraphs with a given minimum degree
• Tension continuous maps -- their structure and applications
• Minimal Representations of Order Types by Geometric Graphs
• On graphs with a given endomorphism monoid
• Graphs and ranks of monoids
• Almost all graphs are rigid - Revisited
• Semigroup theory of symmetry
• Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs
• On tension-continuous mappings
• A surprising permanence of old motivations (a not-so-rigid story)
• REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS

This page was built for publication: On the minimum order of graphs with given semigroup

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