An extension of Turán's theorem, uniqueness and stability
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F14%3A00434441" target="_blank" >RIV/67985840:_____/14:00434441 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
An extension of Turán's theorem, uniqueness and stability
Original language description
We determine the maximum number of edges of an n-vertex graph G with the property that none of its r-cliques intersects a fixed set M...V(G). For (r1)|M|...n, the (r1)-partite Turán graph turns out to be the unique extremal graph. For (r1)|M|.
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
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
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
Electronic Journal of Combinatorics
ISSN
1077-8926
e-ISSN
—
Volume of the periodical
21
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
11
Pages from-to
—
UT code for WoS article
000343611500005
EID of the result in the Scopus database
—