Results 181 to 190 of about 6,012,682 (310)

Sensitivity and Hamming Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT For any m ≥ 3 $m\ge 3$ we show that the Hamming graph H ( n , m ) $H(n,m)$ admits an imbalanced partition into m $m$ sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong m $m$‐ary Sensitivity Conjecture of Asensio, García‐Marco, and Knauer.
Sara Asensio   +3 more
wiley   +1 more source

BCMA-directed mRNA CAR-T cell therapy for myasthenia gravis: exploratory biomarker analysis of a placebo-controlled phase 2b trial. [PDF]

open access: yesNat Med
Fedak RR   +28 more
europepmc   +1 more source

Tight Bounds for Hypercube Minor‐Universality

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT A graph G $G$ is m $m$‐minor‐universal if every graph H $H$ with at most m $m$ edges and no isolated vertices is contained as a minor in G $G$. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c>0 $c\gt 0$ such that the d $d$‐dimensional hypercube Qd ${Q}_{d}$ is (c⋅2d/d $c\cdot {2}^{d}/d$)‐minor‐universal ...
Emma Hogan   +5 more
wiley   +1 more source

Bicompactness of cartesian products [PDF]

open access: yesBulletin of the American Mathematical Society, 1941
Chevalley, Claude, Frink, Orrin
openaire   +3 more sources

Signed Projective Cubes, a Homomorphism Point of View

open access: yesJournal 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   +2 more
wiley   +1 more source

Fast reprogramming and adaptive reproduction of contact-rich assembly. [PDF]

open access: yesFront Robot AI
Rakovitis D   +5 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy