Skip to main content

A Balanced Interval of Two Sets of Points on a Line

  • Conference paper
Combinatorial Geometry and Graph Theory (IJCCGGT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3330))

Abstract

Let n,m,k,h be positive integers such that 1 ≤ nm, 1≤ kn and 1≤ hm. Then we give a necessary and sufficient condition for a configuration with n red points and m blue points on a line to have an interval containing precisely k red points and h blue points.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bárány, I., Matoušek, J.: Simultaneous partitions of measures by k-fans. Discrete Comput. Geom. 25, 317–334 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Goodman, J., O’Rourke, J.: Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  3. Kaneko, A., Kano, M.: Discrete geometry on red and blue points in the plane — A survey. In: Discrete and Computational GeometryE The Goodman-Pollack Festschrift, pp. 551–570. Springer, Heidelberg (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaneko, A., Kano, M. (2005). A Balanced Interval of Two Sets of Points on a Line. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds) Combinatorial Geometry and Graph Theory. IJCCGGT 2003. Lecture Notes in Computer Science, vol 3330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30540-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30540-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24401-1

  • Online ISBN: 978-3-540-30540-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics