Results 41 to 50 of about 1,483,849 (194)

Limbal cystotomy by fine needle aspiration of a translucent iris cyst in a horse

open access: yesEquine Veterinary Education, EarlyView.
Summary A 4‐year‐old Cremello crossbred mare was referred to the Equine Veterinary Teaching Hospital of Utrecht University for a translucent iris cyst from the dorsal pupillary margin corpora nigra in the right eye. Although noninvasive diode laser treatment is the preferred method of pigmented cyst ablation, two attempts did not result in disruption ...
A. L. Hendrikx   +5 more
wiley   +1 more source

On an anti-Ramsey threshold for random graphs

open access: yesEuropean Journal of Combinatorics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshiharu Kohayakawa   +2 more
openaire   +1 more source

Sustainable control of cyathostomin infections in practice

open access: yesEquine Veterinary Education, EarlyView.
Summary Cyathostomins are the most prevalent helminths in horses and are found in nearly all grazing groups. These parasites have been shown to exhibit widespread anthelmintic resistance and can cause clinical disease, so they are a growing concern.
J. B. Matthews, T. S. Mair
wiley   +1 more source

Anti-Ramsey numbers of small graphs

open access: yesArs Comb., 2013
The anti-Ramsey number $AR(n,G$), for a graph $G$ and an integer $n\geq|V(G)|$, is defined to be the minimal integer $r$ such that in any edge-colouring of $K_n$ by at least $r$ colours there is a multicoloured copy of $G$, namely, a copy of $G$ whose edges have distinct colours.
Arie Bialostocki   +2 more
openaire   +2 more sources

The Outer-Planar Anti-Ramsey Number of Matchings

open access: yesSymmetry, 2022
A subgraph H of an edge-colored graph G is called rainbow if all of its edges have different colors. Let ar(G,H) denote the maximum positive integer t, such that there is a t-edge-colored graph G without any rainbow subgraph H. We denote by kK2 a matching of size k and On the class of all maximal outer-planar graphs on n vertices, respectively.
Changyuan Xiang   +3 more
openaire   +1 more source

Demographic Dynamics and International Trade: Stylized Facts and Theoretical Insights

open access: yesJournal of Economic Surveys, EarlyView.
ABSTRACT Demographic change within a country has economic repercussions for other countries through international transactions. Ongoing shifts in population size and age structure across countries have important implications for international trade, operating through changes in market size, consumption preferences, and labor supply.
Kumuthini Sivathas
wiley   +1 more source

On the Existence of a Ramsey Equilibrium with Endogenous Labor Supply and Borrowing Constraints [PDF]

open access: yes
In this paper, we study the existence of an intertemporal equilibrium in a Ramsey model with heterogenous discounting, elastic labor supply and borrowing constraints.
Stefano Bosi, Cuong Le Van
core   +2 more sources

Anti-Ramsey properties of random graphs

open access: yesJournal of Combinatorial Theory, Series B, 2010
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a different color. A graph has property A(b,H) if every b-bounded coloring of its edges has a rainbow copy of H .
Tom Bohman   +3 more
openaire   +1 more source

How Are “Financial Balances” Financed? Wicksell, (Keynes) and the US Mainstream Don't Fit Today's Institutions; Kalecki, Triffin, and Minsky Got it Right

open access: yesMetroeconomica, EarlyView.
ABSTRACT The paper examines the financial balances of the US economy. Government is the main borrower and households and the foreign sector the main lenders. Business net lending is minimal. The balances and their underlying transactions contradict the loanable funds theory and its “global savings glut” variation.
Michalis Nikiforos, Lance Taylor
wiley   +1 more source

Semidefinite Programming and Ramsey Numbers

open access: yes, 2021
Finding exact Ramsey numbers is a problem typically restricted to relatively small graphs. The flag algebra method was developed to find asymptotic results for very large graphs, so it seems that the method is not suitable for finding small Ramsey ...
Lidicky, Bernard, Pfender, Florian
core  

Home - About - Disclaimer - Privacy