Maximum bipartite subgraphs of Kneser graphs

Svatopluk Poljak, Z. Tuza

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

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

Original languageEnglish
Pages (from-to)191-199
Number of pages9
JournalGraphs and Combinatorics
Volume3
Issue number1
DOIs
Publication statusPublished - Dec 1987

Fingerprint

Kneser Graph
Subgraph
Arbitrary
Polytope
Exact Solution
Graph in graph theory

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Cite this

Maximum bipartite subgraphs of Kneser graphs. / Poljak, Svatopluk; Tuza, Z.

In: Graphs and Combinatorics, Vol. 3, No. 1, 12.1987, p. 191-199.

Research output: Contribution to journalArticle

Poljak, Svatopluk ; Tuza, Z. / Maximum bipartite subgraphs of Kneser graphs. In: Graphs and Combinatorics. 1987 ; Vol. 3, No. 1. pp. 191-199.
@article{4374af2439304c66a8b89b7c345dbe87,
title = "Maximum bipartite subgraphs of Kneser graphs",
abstract = "We investigate the maximum number of edges in a bipartite subgraph of the Kneser graph K(n, r). The exact solution is given for either r arbitrary and n ≤ (4.3 + o(1))r, or r = 2 and n arbitrary. The problem is in connection with the study of the bipartite subgraph polytope of a graph.",
author = "Svatopluk Poljak and Z. Tuza",
year = "1987",
month = "12",
doi = "10.1007/BF01788540",
language = "English",
volume = "3",
pages = "191--199",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "1",

}

TY - JOUR

T1 - Maximum bipartite subgraphs of Kneser graphs

AU - Poljak, Svatopluk

AU - Tuza, Z.

PY - 1987/12

Y1 - 1987/12

N2 - We investigate the maximum number of edges in a bipartite subgraph of the Kneser graph K(n, r). The exact solution is given for either r arbitrary and n ≤ (4.3 + o(1))r, or r = 2 and n arbitrary. The problem is in connection with the study of the bipartite subgraph polytope of a graph.

AB - We investigate the maximum number of edges in a bipartite subgraph of the Kneser graph K(n, r). The exact solution is given for either r arbitrary and n ≤ (4.3 + o(1))r, or r = 2 and n arbitrary. The problem is in connection with the study of the bipartite subgraph polytope of a graph.

UR - http://www.scopus.com/inward/record.url?scp=1842748116&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1842748116&partnerID=8YFLogxK

U2 - 10.1007/BF01788540

DO - 10.1007/BF01788540

M3 - Article

VL - 3

SP - 191

EP - 199

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -