Skip to main content
Springer Nature Link
Log in

Maximum bipartite subgraphs of Kneser graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

We investigate the maximum number of edges in a bipartite subgraph of the Kneser graphK(n, r). The exact solution is given for eitherr arbitrary andn ≤ (4.3 + o(1))r, orr = 2 andn arbitrary. The problem is in connection with the study of the bipartite subgraph polytope of a graph.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Ahlswede, R., Katona, G.O.H.: Graphs with maximal number of adjacent pairs of edges. Acta Math. Acad. Sci. Hung.32, 97–120 (1978)

    Google Scholar 

  2. Barahona, F., Grötschel, M., Mahjoub, F.: Facets of the bipartite subgraph polytope. Math. Oper. Res.10, 340–358 (1985)

    Google Scholar 

  3. Barahona, F.: On the complexity of Max-Cut. In: Rapport de Recherche No. 186 IMAG, Universite Scientifique et Medicale de Grenoble 1980

  4. Bárány, I.: A short proof of Kneser's conjecture. J. Comb. Theory (A)25, 325–326 (1976)

    Google Scholar 

  5. Frankl P., Füredi, Z.: Nontrivial intersecting families. J. Comb. Theory (A)41, 150–153 (1986)

    Google Scholar 

  6. Garey, M.R., Johnson, D.S.: The complexity of near optimal graph colouring. J. Assoc. Comput. Math.23, 43–49 (1976)

    Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and Intractibility: A Guide to the Theory of NP-completeness. San Francisco: Freeman 1979

    Google Scholar 

  8. Kneser, M.: Aufgabe 300. Jahresber. Dtsch. Math. -Ver.58, (1955)

  9. Lehel, J., Tuza, Zs.: Triangle-free partial graphs and edge covering theorems. Discrete Math.39, 59–65 (1982)

    Google Scholar 

  10. Lovász, L.: Kneser's conjecture, chromatic number and homotopy. J. Comb. Theory (A)25, 319–324 (1978)

    Google Scholar 

  11. Poljak, S., Turzik, D.: On the structure of bipartite subgraphs ofr-chordal graphs (to appear)

Download references

Author information

Authors and Affiliations

  1. Charles University, Malostranské nám. 25, 11800, Praha 1, Czechoslovakia

    Svatopluk Poljak

  2. Computer and Automation Institute, Kende u. 13-17, H-1111, Budapest, Hungary

    Zsolt Tuza

Authors
  1. Svatopluk Poljak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zsolt Tuza
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by the “AKA” Research Fund of the Hungarian Academy of Sciences

Rights and permissions

Reprints and permissions

About this article

Cite this article

Poljak, S., Tuza, Z. Maximum bipartite subgraphs of Kneser graphs. Graphs and Combinatorics 3, 191–199 (1987). https://doi.org/10.1007/BF01788540

Download citation

  • Received:

  • Issue Date:

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

Keywords