Skip to main content
MathOverflow

Return to Question

deleted 5 characters in body
Source Link
vidyarthi
vidyarthi
  • 2.1k
  • 1
  • 16
  • 22

I wish to know the latest bound on the number of edges a graph of girth greater than or equal to $t$ can have.

Specifically, I heard somewhere that a graph of girth greater than or equal to $t$ can have at most $n^{2-\frac{2}{t}}$$O(n^{2-\frac{2}{t}})$ edges. Is it true?

I wish to know the latest bound on the number of edges a graph of girth greater than or equal to $t$ can have.

Specifically, I heard somewhere that a graph of girth greater than or equal to $t$ can have at most $n^{2-\frac{2}{t}}$ edges. Is it true?

I wish to know the latest bound on the number of edges a graph of girth greater than or equal to $t$ can have.

Specifically, I heard somewhere that a graph of girth greater than or equal to $t$ can have $O(n^{2-\frac{2}{t}})$ edges. Is it true?

Turan -> Turán
Link
LSpice
LSpice
  • 13k
  • 4
  • 45
  • 69

Regarding a specific TuranTurán number of graphs

Source Link
vidyarthi
vidyarthi
  • 2.1k
  • 1
  • 16
  • 22

Regarding a specific Turan number of graphs

I wish to know the latest bound on the number of edges a graph of girth greater than or equal to $t$ can have.

Specifically, I heard somewhere that a graph of girth greater than or equal to $t$ can have at most $n^{2-\frac{2}{t}}$ edges. Is it true?