Results 51 to 60 of about 39,392 (275)
On the Turan number of forests [PDF]
, 2012 The Turan number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. We determine the Turan number and find the unique extremal graph for forests consisting of paths when n is sufficiently ...
Lidický, Bernard +2 more
core
Relationship Between Neurologic Symptoms and Signs and FMR1 Genotype in Premutation Carriers
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background and Objectives Fragile X‐associated Tremor/Ataxia Syndrome (FXTAS) is the most severe late‐onset condition caused by a premutation in the FMR1 gene, characterized by expanded CGG triplet repeats of 55–200. Clinical presentations of FXTAS, including gait ataxia, kinetic tremor, cognitive decline, and rare Parkinsonism, are linked to ...
Flora Tassone +8 more
wiley +1 more source
Arthritis Care &Research, EarlyView.Objective Sjögren's disease is an autoimmune disorder that can impact multiple organ systems, including the peripheral nervous system (PNS). PNS manifestations, which can exist concurrently, include mononeuropathies, polyneuropathies, and autonomic nervous system neuropathies.
Anahita Deboo +88 more
wiley +1 more source
The hyper-Zagreb index of cacti with perfect matchings
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple connected graph. The hyper-Zagreb index is defined as . A connected graph is a cacti if all blocks of are either edges or cycles. Let be the set of cacti of order with a perfect matching and cycles. In this paper, we determine sharp upper
Hechao Liu, Zikai Tang
doaj +1 more source
Problems in extremal graph theory [PDF]
, 2010 We consider a variety of problems in extremal graph and set theory. The {\em chromatic number} of $G$, $\chi(G)$, is the smallest integer $k$ such that $G$ is $k$-colorable.
Ozkahya, Lale
core
Extremal Results in Random Graphs [PDF]
, 2013 According to Paul Erd s [Some notes on Tur n's mathematical work, J. Approx. Theory 29 (1980), page 4] it was Paul Tur n who "created the area of extremal problems in graph theory". However, without a doubt, Paul Erd s popularized extremal combinatorics, by his many contributions to the field, his numerous questions and conjectures, and his ...
Rödl, Vojtěch, Schacht, Mathias
openaire +2 more sources
Arthritis Care &Research, EarlyView.Objective Knee osteoarthritis (OA) commonly affects individuals with type 2 diabetes (T2DM) and is associated with increased risk of diabetes‐related complications. To better understand potential mechanisms, we examined the association between symptomatic knee OA and glycemic control in individuals with T2DM.
Lauren K. King +10 more
wiley +1 more source
, 2010 We show that if G is a graph of sufficiently large order n containing as many r-cliques as the r-partite Turan graph of order n; then for some C>0 G has more than Cn^(r-1) (r+1)-cliques sharing a common edge unless G is isomorphic to the the r-partite ...
Bollobas, Bela, Nikiforov, Vladimir
core +1 more source
Arthritis Care &Research, EarlyView.Objective Frailty occurs prematurely in rheumatoid arthritis (RA) and is associated with poor health outcomes. We compared the performance of four frailty instruments, including a pragmatic alternative measure using chair sit‐to‐stand (STS), and evaluated their abilities to predict poor health outcomes.
Kylie E. Riggles +14 more
wiley +1 more source
Moving to Extremal Graph Parameters [PDF]
, 2013 Which graphs, in the class of all graphs with given numbers n and m of edges and vertices respectively, minimizes or maximizes the value of some graph parameter? In this paper we develop a technique which provides answers for several different parameters:
Cameron, P. J. +2 more
core