On biclique coverings
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F08%3A00021103" target="_blank" >RIV/61989100:27240/08:00021103 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On biclique coverings
Original language description
It was proved by Fronček, Jerebic, Klavžar, and Kovář that if a complete bipartite graph $K_{n,n}$ with a perfect matching removed can be covered by $k$ bicliques, then $n leq {k choose lfloorfrac{k}{2}rfloor}$. We give a slightly simplified proof and weshow that the result is tight. Moreover we use the result to prove analogous bounds for coverings of some other classes of graphs by bicliques.
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
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
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
Discrete Mathematics
ISSN
0012-365X
e-ISSN
—
Volume of the periodical
308
Issue of the periodical within the volume
2-3
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
5
Pages from-to
—
UT code for WoS article
000252604400022
EID of the result in the Scopus database
—