Pages that link to "Item:Q427676"
From MaRDI portal
The following pages link to Graphs with maximum size and lower bounded girth (Q427676):
Displaying 15 items.
- Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs (Q423957) (← links)
- Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\) (Q608265) (← links)
- New families of graphs without short cycles and large size (Q708348) (← links)
- On the girth of extremal graphs without shortest cycles (Q998448) (← links)
- On erasure combinatorial batch codes (Q1783704) (← links)
- Extremal edge-girth-regular graphs (Q2053682) (← links)
- Exact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\) (Q2175811) (← links)
- Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\) (Q2341706) (← links)
- Lower bound for the size of maximal nontraceable graphs (Q2571275) (← links)
- Bounded-degree graphs can have arbitrarily large slope numbers (Q2583679) (← links)
- On extremal graphs with bounded girth (Q2851535) (← links)
- PROPERTY A AND GRAPHS WITH LARGE GIRTH (Q3094726) (← links)
- Sparse Matrix Feature Selection in Multi-label Learning (Q3300274) (← links)
- Size of Graphs with High Girth (Q3503470) (← links)
- (Q4937814) (← links)
