Irreducible coverings by cliques and Sperner's theorem.
The Electronic Journal of Combinatorics [electronic only] (2002)
- Volume: 9, Issue: 1, page Research paper N11, 4 p.-Research paper N11, 4 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topTomescu, Ioan. "Irreducible coverings by cliques and Sperner's theorem.." The Electronic Journal of Combinatorics [electronic only] 9.1 (2002): Research paper N11, 4 p.-Research paper N11, 4 p.. <http://eudml.org/doc/122807>.
@article{Tomescu2002,
author = {Tomescu, Ioan},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {clique; irreducible covering; antichain; Sperner's theorem},
language = {eng},
number = {1},
pages = {Research paper N11, 4 p.-Research paper N11, 4 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Irreducible coverings by cliques and Sperner's theorem.},
url = {http://eudml.org/doc/122807},
volume = {9},
year = {2002},
}
TY - JOUR
AU - Tomescu, Ioan
TI - Irreducible coverings by cliques and Sperner's theorem.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2002
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 9
IS - 1
SP - Research paper N11, 4 p.
EP - Research paper N11, 4 p.
LA - eng
KW - clique; irreducible covering; antichain; Sperner's theorem
UR - http://eudml.org/doc/122807
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.