[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article

Flattening Antichains

Published: 01 February 2006 Publication History

Abstract

A flat antichain is a collection of incomparable subsets of a finite ground set, such that |B|−|C|≤1 for every two members B, C. Using Lieby’s results, we prove the Flat Antichain Conjecture, which says that for any antichain there exists a flat antichain having the same cardinality and average set size.

Cited By

View all
  • (2020)Efficient intervention design for causal discovery with latentsProceedings of the 37th International Conference on Machine Learning10.5555/3524938.3524945(63-73)Online publication date: 13-Jul-2020
  • (2014)Antichains and completely separating systems-A catalogue and applicationsDiscrete Applied Mathematics10.1016/j.dam.2012.04.016163(165-180)Online publication date: 1-Jan-2014

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Combinatorica
Combinatorica  Volume 26, Issue 1
February 2006
118 pages

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 February 2006

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2020)Efficient intervention design for causal discovery with latentsProceedings of the 37th International Conference on Machine Learning10.5555/3524938.3524945(63-73)Online publication date: 13-Jul-2020
  • (2014)Antichains and completely separating systems-A catalogue and applicationsDiscrete Applied Mathematics10.1016/j.dam.2012.04.016163(165-180)Online publication date: 1-Jan-2014

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media