Skip to main content
Log in

The combinatorial structure of (m, n)-convex sets

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

LetS be a closed subset of a Hausdorff linear topological space,S having no isolated points, and letc s (m) denote the largest integern for whichS is (m,n)-convex. Ifc s (k)=0 andc s (k+1)=1, then

$$ c_s \left( m \right) = \sum\limits_{i = 1}^k {\left( {\begin{array}{*{20}c} {\left[ {\frac{{m + k - i}} {k}} \right]} \\ 2 \\ \end{array} } \right)} $$

. Moreover, ifT is a minimalm subset ofS, the combinatorial structure ofT is revealed.

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. J. Kaapke,Über eine Verallgemeinerung der Valentineschen P 3 -Eigenschaft, Geometriae Dedicata, to appear.

  2. David C. Kay and Merle D. Duay,Convexity and a certain property P m , Israel. J. Math.8 (1970), 39–52.

    Article  MATH  MathSciNet  Google Scholar 

  3. P. Turán,On the theory of graphs, Colloq. Math.3 (1964), 19–30.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Breen, M. The combinatorial structure of (m, n)-convex sets. Israel J. Math. 15, 367–374 (1973). https://doi.org/10.1007/BF02757075

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02757075

Keywords

Navigation