0 the measurement round a tree, a person’s waist etc -- ukur keliling
1 the strap that holds a saddle on a horse. -- tali perut
Estimating the liveweight of sheep from chest girth measurements.
However, we do not compute the precise constants for any particular bound on girth.
The bound is close to optimal for -regular graphs of large girth (as can be seen from monotonicity results from [26]).
The girth of a graph is the length of the shortest cycle, or infinity if the graph has no cycles.
In this last paper it was shown that no bound better than 2 o can be found for graphs with arbitrarily large odd girth.
The graph properties that we try to maintain are connectivity and girth.
The resulting graph is planar, of order 87 and with girth 5, and it is not (2, 1) -colourable.
In particular, we construct colour-critical graphs and hypergraphs of high girth with moderate average degree.