Irreducible coverings by cliques and Sperner's theorem

zbMATH Open1018.05079MaRDI QIDQ1856342

Ioan Tomescu

Publication date: 13 May 2003

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122807

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

antichaincliqueSperner's theoremirreducible covering

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem ⋮ Clique numbers of graphs and irreducible exact \(m\)-covers of the integers ⋮ The sensitivity conjecture, induced subgraphs of cubes, and Clifford algebras

This page was built for publication: Irreducible coverings by cliques and Sperner's theorem