Results 121 to 130 of about 57,717 (241)

Girth Rigging for Side Saddles. [PDF]

, 1895
Patent for girth-rigging for side-saddles that secure the saddles so the saddles only move when the horse does. It has an extended "saddle-tree so as to produce shoulders, the same underlying the saddle-seat at its front and in supporting upon its ...
Padgitt, Jesse D.
core  

More on the girth of graphs on Weyl groups [PDF]

, 1993
summary:The girth of graphs on Weyl groups, with no restriction on the associated root system, is determined. It is shown that the girth, when it is defined, is 3 except for at most four graphs for which it does not exceed ...
Hulsurkar, S. G., S. G. Hulsurkar, Samy A. Youssef, Youssef, Samy A.   +3 more
core  

High-girth Steiner triple systems [PDF]

We prove a 1973 conjecture due to Erdős on the existence of Steiner triple systems with arbitrarily high ...
Simkin, Michael, Sah, Ashwin, Sawhney, Mehtaab, Kwan, Matthew Alan ; https://orcid.org/   +3 more
core   +1 more source

Saddle Girth. [PDF]

, 1882
Patent for a new and improved saddle girth. This design consists in "[t]he combination, with the central ring and pad, of the strips and the radiating straps . . .
Williams, Calvin
core  

On Mixed Cages of Girth 6 [PDF]

A [z,r;g]-mixed cage is a mixed graph of minimum order such that each vertex has z in-arcs, z out-arcs, r edges, and it has girth g. We present an infinite family of mixed graphs with girth 6. This construction also provides an upper bound on the minimum
Mendoza-Cadena, Lydia Mirabel, Araujo-Pardo, Gabriela   +1 more
core   +1 more source

On the Ramsey number of 4-cycle versus wheel

Indonesian Journal of Combinatorics, 2016
For any fixed graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest positive integer $n$ such that for every graph $F$ on $n$ vertices must contain $G$ or the complement of $F$ contains $H$.
Enik Noviani, Edy Tri Baskoro
doaj  

On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration [PDF]

A vertex-girth-regular $vgr(v,k,g,λ)$-graph is a $k$-regular graph of girth $g$ and order $v$ in which every vertex belongs to exactly $λ$ cycles of length $g$.
Jooken, Jorik, Porupsánszki, István, Jajcay, Robert   +2 more
core   +1 more source

The CIDR-GPG Protocol Improves Reproductive Efficiency in Yaks and Lowers the Body Condition Requirements for Success. [PDF]

Animals (Basel)
Song Z, Cheng J, Wang C, Yin Q, Chen Z, Li R, Yang Y, Ji Y, Li J, Liu Y, Caiwang G, Gao Y, Hua G.   +12 more
europepmc   +1 more source

Girth-regular and edge-girth-regular graphs

, 2019
Magistrska naloga obravnava ožinsko-regularne in povezavno-ožinsko-regularne grafe. Podpis vozlišča u v grafu je k-terica celih števil, urejenih po velikosti od najmanjšega do največjega, kjer vsako število predstavlja število ožinskih ciklov, v katerih je vsebovana posamezna povezava, incidenčna z u.
openaire   +1 more source

Morphometric characterization and decision tree-based prediction of phenotypic traits in Pantaneiro sheep. [PDF]

Trop Anim Health Prod
Valério AC, Fernandes T, da Silva ALA, Chagas RA, Leonardo AP, de Souza MR, da Silva NMV, de Vargas Junior FM.   +7 more
europepmc   +1 more source