Abstract
G p = (V, X) is a graph on p vertices, with vertex set V and edge set X. Occasionally, to avoid ambiguity, V and X will be written V(G P ) and X(G P ), respectively.
Cite
CITATION STYLE
APA
Edwards, C. S. (1973). Some Extremal Properties of Bipartite Subgraphs. Canadian Journal of Mathematics, 25(3), 475–485. https://doi.org/10.4153/cjm-1973-048-x
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free