Skip to main content
MathOverflow

Return to Question

added 6 characters in body
Source Link
Kim
Kim
  • 389
  • 2
  • 12

Suppose $G(V_1 \cup V_2, E)$ is a bipartite graph with parts $|V_1|=n$ and $|V_2|=m.$ What is the best known lower bound construction for the maximum number of edges in $G$ when $G$ does not have a cycle of length $8.$

I'm looking for some references.

Suppose $G(V_1 \cup V_2, E)$ is a bipartite graph with parts $|V_1|=n$ and $|V_2|=m.$ What is the best lower bound construction for the maximum number of edges in $G$ when $G$ does not have a cycle of length $8.$

I'm looking for some references.

Suppose $G(V_1 \cup V_2, E)$ is a bipartite graph with parts $|V_1|=n$ and $|V_2|=m.$ What is the best known lower bound construction for the maximum number of edges in $G$ when $G$ does not have a cycle of length $8.$

I'm looking for some references.

Source Link
Kim
Kim
  • 389
  • 2
  • 12

Lower bound construction for the extremal number of $C_{2k}$-free bipartite graph

Suppose $G(V_1 \cup V_2, E)$ is a bipartite graph with parts $|V_1|=n$ and $|V_2|=m.$ What is the best lower bound construction for the maximum number of edges in $G$ when $G$ does not have a cycle of length $8.$

I'm looking for some references.