Skip to main content
SpringerLink
Log in

The Gold Partition Conjecture for 6-Thin Posets

  • Published:
Order Aims and scope Submit manuscript

Abstract

We consider the Gold Partition Conjecture (GPC) that implies the 1/3–2/3 Conjecture. We prove the GPC in the case where every element of the poset is incomparable with at most six others. The proof involves the extensive use of computers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Brightwell, G.: Linear extensions of infinite posets. Discrete Math. 70, 113–136 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brightwell, G., Wright, C.D.: The 1/3–2/3 conjecture for 5-thin posets. SIAM J. Discrete Math. 5, 467–474 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Lipski, W.: Kombinatoryka dla programistów (Combinatorics for Programmers), 3rd edn. WNT, Warsaw (2004)

    Google Scholar 

  4. Peczarski, M.: New results in minimum-comparison sorting. Algorithmica 40, 133–145 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Peczarski, M.: The gold partition conjecture. Order 23, 89–95 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Peczarski, M.: Komputerowo wspomagane badanie zbiorów częściowo uporządkowanych (Computer Assisted Research of Posets). Ph.D. thesis, University of Warsaw, Warsaw (2006)

  7. Ullman, J.R.: An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach. 23, 31–42 (1976)

    MATH  MathSciNet  Google Scholar 

  8. Varol, Y.L., Rotem, D.: An algorithm to generate all topological sorting arrangements. Comput. J. 24, 83–84 (1981)

    Article  MATH  Google Scholar 

  9. Wells, M.: Elements of Combinatorial Computing. Pergamon Press, Oxford (1971)

    MATH  Google Scholar 

  10. Wright, C.D.: Combinatorial Algorithms. Ph.D. thesis, Cambridge University, Cambridge (1990)

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097, Warsaw, Poland

    Marcin Peczarski

Authors
  1. Marcin Peczarski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcin Peczarski.

Additional information

This paper contains results obtained using computer resources of the Interdisciplinary Centre for Mathematical and Computational Modelling (ICM), University of Warsaw.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peczarski, M. The Gold Partition Conjecture for 6-Thin Posets. Order 25, 91–103 (2008). https://doi.org/10.1007/s11083-008-9081-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-008-9081-9

Keywords

Search

Navigation