Results 41 to 50 of about 2,369,458 (297)
Two Remarks on Independent Sets [PDF]
Let \(S = k[x_ v,\;v \in V]\) be a polynomial ring over a field \(k\), equipped with a noetherian term order \(
openaire +2 more sources
Statistical mechanics of maximal independent sets [PDF]
The graph theoretic concept of maximal independent set arises in several practical problems in computer science as well as in game theory. A maximal independent set is defined by the set of occupied nodes that satisfy some packing and covering constraints.
Dall'Asta, Luca +2 more
openaire +5 more sources
ABSTRACT Background Pediatric patients with extracranial solid tumors (ST) receiving chemotherapy are at an increased risk for Pneumocystis jirovecii pneumonia (PJP). However, evidence guiding prophylaxis practices in this population is limited. A PJP‐related fatality at our institution highlighted inconsistent prescribing approaches and concerns about
Kriti Kumar +8 more
wiley +1 more source
The Hilton-Spencer Cycle Theorems Via Katona’s Shadow Intersection Theorem
A family 𝒜 of sets is said to be intersecting if every two sets in 𝒜 intersect. An intersecting family is said to be trivial if its sets have a common element.
Borg Peter, Feghali Carl
doaj +1 more source
Sickle Cell Disease Is an Inherent Risk for Asthma in a Sibling Comparison Study
ABSTRACT Introduction Sickle cell disease (SCD) and asthma share a complex relationship. Although estimates vary, asthma prevalence in children with SCD is believed to be comparable to or higher than the general population. Determining whether SCD confers an increased risk for asthma remains challenging due to overlapping symptoms and the ...
Suhei C. Zuleta De Bernardis +9 more
wiley +1 more source
On some invariants of finite groups [PDF]
In this note we are going to survey several invariants of finite groups related either to theirorders or to generating sets or to lattices of subgroups. Some relations among these invariants will be exhibited.
Jan Krempa, Agnieszka Stocka
doaj
Maximum Independent Sets in Direct Products of Cycles or Trees with Arbitrary Graphs
The direct product of graphs G = (V (G),E(G)) and H = (V (H),E(H)) is the graph, denoted as G×H, with vertex set V (G×H) = V (G)×V (H), where vertices (x1, y1) and (x2, y2) are adjacent in G × H if x1x2 ∈ E(G) and y1y2 ∈ E(H). Let n be odd and m even. We
Paj Tjaša, Špacapan Simon
doaj +1 more source
Stable sets versus independent sets
The matroidal number \(m(G)\) of a graph \(G\) is defined as the smallest integer \(m\) so that the collection of the stable sets of \(G\) arises as \(I_ 1\cup I_ 2 \cup \cdots \cup I_ m\) where the \(I_ i\) are collections of independent sets of matroids on the vertex set of \(G\).
openaire +2 more sources
ABSTRACT Background In Ewing sarcoma (EwS), metastases, including those to bone marrow (BM), are the main factors influencing prognosis. Although reverse transcription polymerase chain reaction (RT‐PCR) offers greater sensitivity, the current EWING protocol defines BM metastases solely using light microscopic detection.
Thanh Pham +13 more
wiley +1 more source
Some Results on the Independence Polynomial of Unicyclic Graphs
Let G be a simple graph on n vertices. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of G is the polynomial I(G,x)=∑k=0ns(G,k)xk$I(G,x) = \sum\nolimits_{k = 0}^n {s\left({G,k} \right)x^k }$, where s(
Oboudi Mohammad Reza
doaj +1 more source

