Document Type
Lecture
Publication Date
1-30-2003
Abstract
The bipartite density of a graph is the fraction of edges in a largest bipartite subgraph. Some results of Bondy, Locke, Hopkins and Staton will be reviewed and a most interesting conjecture of Erd¨os will be presented.
Relational Format
presentation
Recommended Citation
Staton, William, "On the Bipartite Density of a Graph" (2003). Combinatorics Seminar. 119.
https://egrove.olemiss.edu/math_combinatorics/119
COinS
