The following pages link to (Q3624955):
Displaying 8 items.
- On the girth of extremal graphs without shortest cycles (Q998448) (← links)
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) (Q1026123) (← links)
- Properties of certain families of \(2k\)-cycle-free graphs (Q1322024) (← links)
- The size of bipartite graphs with a given girth (Q1403918) (← links)
- High-girth graphs avoiding a minor are nearly bipartite (Q1850553) (← links)
- On extremal bipartite graphs with high girth (Q3439643) (← links)
- On the structure of extremal graphs of high girth (Q4364808) (← links)
- (Q5461438) (← links)