The size of the largest bipartite subgraphs

Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

Simple proofs are given for results of Edwards concerning the size of the largest bipartite subgraphs of a graph.

Original languageEnglish
Pages (from-to)267-271
Number of pages5
JournalDiscrete Mathematics
Volume177
Issue number1-3
DOIs
Publication statusPublished - Dec 1 1997

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'The size of the largest bipartite subgraphs'. Together they form a unique fingerprint.

  • Cite this