Results 201 to 210 of about 70,930 (280)

From phenomena to phrasing: rethinking seizure classification through history. [PDF]

Brain
Soni AJ.
europepmc   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

Towards building a meaningful clinical training program: a comparison of obstetrics and gynecology undergraduate medical education in Germany and Japan. [PDF]

Nagoya J Med Sci
Yoshihara M, Roisenwasser L, Fehm TN, Nishigori H, Kajiyama H.   +4 more
europepmc   +1 more source

Halin's Grid Theorem for Digraphs

Journal of Graph Theory, EarlyView.
ABSTRACT Halin showed that every thick end of every graph contains an infinite grid. We extend Halin's theorem to digraphs. More precisely, we show that for every infinite family ℛ ${\rm{ {\mathcal R} }}$ of disjoint equivalent out‐rays there is a grid whose vertical rays are contained in ℛ ${\rm{ {\mathcal R} }}$.
Florian Reich
wiley   +1 more source

Moral integration influences English as a Foreign Language (EFL) oral English learning: Evidence from textbook analysis and learner feedback. [PDF]

PLoS One
Yang X, Nie Q.
europepmc   +1 more source

On a Clique‐Building Game of Erdős

Journal of Graph Theory, EarlyView.
ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley   +1 more source

Chromatic Ramsey Numbers and Two‐Color Turán Densities

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley   +1 more source

The Art of Reception: Field Visits as Microcosms for Development Interventions of Non‐Governmental Organisations in Uganda

Journal of International Development, EarlyView.
ABSTRACT Field visits are common phenomena with non‐governmental organisations in Uganda. During these visits, Ugandan national staff guide visitors on series of meetings and interactions in the field. Following an actor‐oriented approach and drawing on ethnographic data on 14 field visits, this paper understands the field visit as a microcosm for the ...
Caspar Edward Swinkels
wiley   +1 more source