Universality of intervals of line graph order
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10282633" target="_blank" >RIV/00216208:11320/14:10282633 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ejc.2014.04.008" target="_blank" >http://dx.doi.org/10.1016/j.ejc.2014.04.008</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2014.04.008" target="_blank" >10.1016/j.ejc.2014.04.008</a>
Alternative languages
Result language
angličtina
Original language name
Universality of intervals of line graph order
Original language description
We prove that for every d at least 3 the homomorphism order of the class of line graphs of finite graphs with maximal degree d is universal. This means that every finite or countably infinite partially ordered set may be represented by line graphs of graphs with maximal degree d ordered by the existence of a homomorphism.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
European Journal of Combinatorics
ISSN
0195-6698
e-ISSN
—
Volume of the periodical
41
Issue of the periodical within the volume
October
Country of publishing house
GB - UNITED KINGDOM
Number of pages
11
Pages from-to
221-231
UT code for WoS article
—
EID of the result in the Scopus database
—