Irreducible coverings by cliques and Sperner's theorem

zbMATH Open1018.05079MaRDI QIDQ1856342FDOQ1856342

Authors: 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.)

Recommendations

• scientific article; zbMATH DE number 2090010
• Extremal and asymptotic properties of irreducible coverings of graphs by cliques
• scientific article; zbMATH DE number 3966126
• scientific article; zbMATH DE number 3762108
• Clique covering of graphs

zbMATH Keywords

cliqueantichainSperner's theoremirreducible covering

Mathematics Subject Classification ID

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

Cited In (6)

• The sensitivity conjecture, induced subgraphs of cubes, and Clifford algebras
• Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
• Largest reduced neighborhood clique cover number revisited
• Title not available (Why is that?)
• Clique numbers of graphs and irreducible exact \(m\)-covers of the integers
• Extremal and asymptotic properties of irreducible coverings of graphs by cliques

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1856342)