Note on bipartite graph tilings
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10062299" target="_blank" >RIV/00216208:11320/10:10062299 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Note on bipartite graph tilings
Original language description
We study what are the minimum degree conditions for a bipartite graph G which ensure that G has a K_{s,t}-factor. Exact result for large G is given.
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
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2010
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
SIAM Journal on Discrete Mathematics [online]
ISSN
1095-7146
e-ISSN
—
Volume of the periodical
24
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
6
Pages from-to
—
UT code for WoS article
000279114200001
EID of the result in the Scopus database
—