Pages that link to "Item:Q4364808"
From MaRDI portal
The following pages link to On the structure of extremal graphs of high girth (Q4364808):
Displaying 24 items.
- Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs (Q423957) (← links)
- Graphs with maximum size and lower bounded girth (Q427676) (← links)
- High girth augmented trees are huge (Q739384) (← links)
- The NIP graph of a social welfare function (Q836926) (← links)
- 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)
- On the number of cycles possible in digraphs with large girth (Q1058526) (← links)
- Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\) (Q1680880) (← links)
- High-girth graphs avoiding a minor are nearly bipartite (Q1850553) (← links)
- Dense graphs with cycle neighborhoods (Q1892847) (← links)
- Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\) (Q2341706) (← links)
- General properties of some families of graphs defined by systems of equations (Q2757094) (← links)
- On extremal graphs with bounded girth (Q2851535) (← links)
- Extremal graphs without cycles of length 8 or less (Q2857416) (← links)
- The constructions and the judgement algorithms about G-extremal graphs and G-near-extremal graphs (Q2926814) (← links)
- Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles (Q2947856) (← links)
- On the Structure of Graphs with Given Odd Girth and Large Minimum Degree (Q2947860) (← links)
- On extremal bipartite graphs with high girth (Q3439643) (← links)
- Size of Graphs with High Girth (Q3503470) (← links)
- (Q3624955) (← links)
- Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille (Q3644810) (← links)
- (Q4501678) (← links)
- (Q5461438) (← links)
- Radius \(r\) extremal graphs of girth 5 (Q6562417) (← links)
