Name
Abstract | ||
|---|---|---|
Attempts to enumerate maximal antichains in Boolean lattices give rise to problems involving maximal independent sets in bipartite graphs whose vertex sets are comprised of adjacent levels of the lattice and whose edges correspond to proper containment. In this paper, we find bounds on the numbers of maximal independent sets in these graphs. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.ejc.2010.08.004 | Eur. J. Comb. |
Keywords | Field | DocType |
maximal antichains,maximal independent set,bipartite graph,vertex set,adjacent level,proper containment,boolean lattice | Graph,Complete bipartite graph,Discrete mathematics,Combinatorics,Lattice (order),Vertex (geometry),Bipartite graph,Matching (graph theory),Independent set,Mathematics,Maximal independent set | Journal |
Volume | Issue | ISSN |
32 | 1 | 0195-6698 |
Citations | PageRank | References |
8 | 0.81 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dwight Duffus | 1 | 111 | 36.63 |
| Peter Frankl | 2 | 578 | 126.03 |
| Vojtch RöDl | 3 | 11 | 2.03 |