Skip to main content
Log in

First-Fit is Linear on Posets Excluding Two Long Incomparable Chains

  • Published:
Order Aims and scope Submit manuscript

Abstract

A poset is \((\underline{r}+\underline{s})\)-free if it does not contain two incomparable chains of size r and s, respectively. We prove that when r and s are at least 2, the First-Fit algorithm partitions every \((\underline{r}+\underline{s})\)-free poset P into at most 8(r − 1)(s − 1)w chains, where w is the width of P. This solves an open problem of Bosek et al. (SIAM J Discrete Math 23(4):1992–1999, 2010).

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bosek, B., Felsner, S., Kloch, K., Krawczyk, T., Matecki, G., Micek, P.: On-line chain partitions of orders: a survey. www.math.tu-berlin.de/∼felsner/Paper/ol-survey.pdf (2010). Accessed 10 Oct 2010

  2. Bosek, B., Krawczyk, T., Szczypka, E.: First-fit algorithm for the on-line chain partitioning problem. SIAM J. Discrete Math. 23(4), 1992–1999 (2010)

    Article  MathSciNet  Google Scholar 

  3. Bosek, B., Krawczyk, T.: The subexponential upper bound for on-line chain partitioning problem. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010) (2010)

  4. Chrobak, M., Ślusarek, M.: On some packing problem related to dynamic storage allocation. RAIRO Inform. Théor. Appl. 22(4), 487–499 (1988)

    MathSciNet  MATH  Google Scholar 

  5. Felsner, S., Krawczyk, T., Trotter, W.T.: On-line dimension for posets excluding two long incomparable chains. www.math.tu-berlin.de/∼felsner/Paper/oldim.pdf (2010). Accessed 10 Oct 2010

  6. Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psychol. 7, 144–149 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kierstead, H.A., Qin, J.: Coloring interval graphs with First-Fit. Discrete Math. 144(1–3), 47–57 (1995) (Combinatorics of ordered sets (Oberwolfach, 1991))

    Article  MathSciNet  MATH  Google Scholar 

  8. Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. In: Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, vol. II (Baton Rouge, La., 1981), vol. 33, pp. 143–153 (1981)

  9. Kierstead, H.A.: Recursive ordered sets. In: Combinatorics and ordered sets (Arcata, Calif., 1985). Contemp. Math., vol. 57, pp. 75–102. Amer. Math. Soc., Providence, RI (1986)

  10. Kierstead, H.A.: The linearity of first-fit coloring of interval graphs. SIAM J. Discrete Math. 1(4), 526–530 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  11. Narayanaswamy, N.S., Subhash Babu, R.: A note on first-fit coloring of interval graphs. Order 25(1), 49–53 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Pemmaraju, S.V., Raman, R., Varadarajan, K.: Buffer minimization using max-coloring. In: SODA ’04: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 562–571. Society for Industrial and Applied Mathematics (2004)

  13. Pemmaraju, S.V., Raman, R., Varadarajan, K.: Max-coloring and online coloring with bandwidths on interval graphs. ACM Transactions on Algorithms (2010, accepted)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kevin G. Milans.

Additional information

This work was supported in part by the Actions de Recherche Concertées (ARC) fund of the Communauté française de Belgique. Gwenaël Joret is a Postdoctoral Researcher of the Fonds National de la Recherche Scientifique (F.R.S.–FNRS).

Kevin G. Milans acknowledges support of the National Science Foundation through a fellowship funded by the grant “EMSW21-MCTP: Research Experience for Graduate Students” (NSF DMS 08-38434).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Joret, G., Milans, K.G. First-Fit is Linear on Posets Excluding Two Long Incomparable Chains. Order 28, 455–464 (2011). https://doi.org/10.1007/s11083-010-9184-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-010-9184-y

Keywords

Navigation