Results 81 to 90 of about 76,042 (299)
Local algorithms, regular graphs of large girth, and random regular graphs
, 2016 We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random regular graphs into (
Hoppen, Carlos, Wormald, Nicholas
core +1 more source
Equine Veterinary Education, EarlyView.Summary Background Dynamic mobilisation exercises (DMEs) are prescribed to support locomotor function, but knowledge of their longitudinal effect on thoracolumbosacral (TLS) spinal kinematics is limited. Objectives To evaluate the effect of a 6‐week DME program on TLS kinematics during standing reflexes, walking and trotting.
V. Walker +6 more
wiley +1 more source
The Relationship Between Stature and Live Weight of Dairy Cows Between Birth and Maturity
RuminantsLactational and reproductive performance are strongly associated with cow live weight and capacity. However, there are limited data published describing capacity (thoracic) growth and the prediction of final stature and capacity from measurements at ...
Michaela J. Gibson +5 more
doaj +1 more source
Light Graphs In Planar Graphs Of Large Girth
Discussiones Mathematicae Graph Theory, 2016 A graph H is defined to be light in a graph family 𝒢 if there exist finite numbers φ(H, 𝒢) and w(H, 𝒢) such that each G ∈ 𝒢 which contains H as a subgraph, also contains its isomorphic copy K with ΔG(K) ≤ φ(H, 𝒢) and ∑x∈V(K) degG(x) ≤ w(H, 𝒢).
Hudák Peter +3 more
doaj +1 more source
High Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges
Discussiones Mathematicae Graph Theory, 2022 A classical result of Erdős and Hajnal claims that for any integers k, r, g ≥ 2 there is an r-uniform hypergraph of girth at least g with chromatic number at least k.
Axenovich Maria, Karrer Annette
doaj +1 more source
On the smallest snarks with oddness 4 and connectivity 2 [PDF]
, 2018 A snark is a bridgeless cubic graph which is not 3-edge-colourable. The oddness of a bridgeless cubic graph is the minimum number of odd components in any 2-factor of the graph. Lukot'ka, M\'acajov\'a, Maz\'ak and \v{S}koviera showed in [Electron.
Goedgebeur, Jan
core +2 more sources
Biregular Cages of Girth Five [PDF]
The Electronic Journal of Combinatorics, 2013 Let $2 \le r < m$ and $g$ be positive integers. An $(\{r,m\};g)$-graph (or biregular graph) is a graph with degree set $\{r,m\}$ and girth $g$, and an $(\{r,m\};g)$-cage (or biregular cage) is an $(\{r,m\};g)$-graph of minimum order $n(\{r,m\};g)$.
Abreu, Marién +4 more
openaire +3 more sources
Cardiac arrhythmia prevalence and risk factors in 24‐h electrocardiograms of sedentary horses
Equine Veterinary Journal, EarlyView.Abstract Background Cardiac arrhythmias are common in horses, but their clinical relevance remains controversial. Objectives To describe prevalence and identify risk factors for arrhythmias that may warrant additional screening in a sedentary mixed‐breed population of horses. Study Design Prospective cross‐sectional.
Lauren T. Maas +6 more
wiley +1 more source
Equine Veterinary Journal, EarlyView.Abstract Background Physical restraint of horses for veterinary procedures is necessary to allow completion of tasks effectively and without injury to patient or personnel. Objectives To compare physiological effects and behavioural responses to four commonly used restraint techniques for upper respiratory tract (URT) endoscopy in unsedated horses ...
Claire O'Brien +5 more
wiley +1 more source
Graphical small cancellation groups with the Haagerup property [PDF]
, 2014 We prove the Haagerup property (= Gromov's a-T-menability) for finitely generated groups defined by infinite presentations satisfying the graphical C'(lambda)-small cancellation condition with respect to graphs endowed with a compatible wall structure ...
Arzhantseva, Goulnara, Osajda, Damian
core