Skip to main content
MathOverflow

Return to Question

added 46 characters in body
Source Link
Ken
Ken
  • 397
  • 1
  • 7

There is a construction of a bipartite graph $G=(V_1 \cup V_2, E),$ where $|V_1|=|V_2|=n$ and$|V_1|=|V_2|=n,$ $|E| \geq \Omega(n^{6/5}).$$|E| \geq \Omega(n^{6/5}),$ such that $G$ does not cotain any cycle of length $8.$

I was wondering if someone knows this construction or introduce me a reference for that?

There is a construction of a bipartite graph $G=(V_1 \cup V_2, E),$ where $|V_1|=|V_2|=n$ and $|E| \geq \Omega(n^{6/5}).$

I was wondering if someone knows this construction or introduce me a reference for that?

There is a construction of a bipartite graph $G=(V_1 \cup V_2, E),$ where $|V_1|=|V_2|=n,$ $|E| \geq \Omega(n^{6/5}),$ such that $G$ does not cotain any cycle of length $8.$

I was wondering if someone knows this construction or introduce me a reference for that?

Source Link
Ken
Ken
  • 397
  • 1
  • 7

Cycles of length $8$

There is a construction of a bipartite graph $G=(V_1 \cup V_2, E),$ where $|V_1|=|V_2|=n$ and $|E| \geq \Omega(n^{6/5}).$

I was wondering if someone knows this construction or introduce me a reference for that?