Results 51 to 60 of about 2,863,059 (142)
Bulletin of the London Mathematical Society, Volume 57, Issue 3, Page 895-912, March 2025.Abstract We prove that at differentiability points r0>0$r_0>0$ of the volume function of a compact set A⊂Rd$A\subset \mathbb {R}^d$ (associating to r$r$ the volume of the r$r$‐parallel set of A$A$), the surface area measures of r$r$‐parallel sets of A$A$ converge weakly to the surface area measure of the r0$r_0$‐parallel set as r→r0$r\rightarrow r_0 ...
Jan Rataj, Steffen Winter
wiley +1 more source
Cancer Reports, Volume 8, Issue 1, January 2025.ABSTRACT Background Malignant tumors release growth factors, promoting lymphangiogenesis in primary tumors and draining sentinel lymph nodes, ultimately facilitating lymph node metastasis. As a malignant lymphatic tumor entity, lymphangiosarcomas are characterized by low survival rates and limited treatment options. The transcription factor SOX18 plays
Katja K. Koll +4 more
wiley +1 more source
A Sharp Threshold for a Random Version of Sperner's Theorem
Random Structures &Algorithms, Volume 66, Issue 1, January 2025.ABSTRACT The Boolean lattice 𝒫(n) consists of all subsets of [n]={1,…,n}$$ \left[n\right]=\left\{1,\dots, n\right\} $$ partially ordered under the containment relation. Sperner's Theorem states that the largest antichain of the Boolean lattice is given by a middle layer: the collection of all sets of size n/2$$ \left\lfloor n/2\right\rfloor $$, or also,
József Balogh, Robert A. Krueger
wiley +1 more source
On Kneser Solutions of Third-order Delay Dynamic Equations
, 2010 Some new criteria for the asymptotic and oscillatory behavior of third-order linear delay dynamic equations on time scales are established. Several results are presented that offer conditions guaranteeing that every nonoscillatory solution of the ...
Bohner, Martin +2 more
core
Choice number of Kneser graphs
, 2021 In this short note, we show that for any $\epsilon >0$ and ...
Kupavskii, Andrey, Bulankina, Vera
core
Path Decompositions of the Kneser Graph [PDF]
, 2013 Necessary and sufficient conditions are given for the existence of a graph decomposition of the Kneser Graph $KG_{n,2}$ into paths of length three and four, and of the Generalized Kneser Graph $GKG_{n,3,1}$ into paths of length three. A solution is also
Whitt, Thomas Richard, III
core
A note on homomorphisms of Kneser hypergraphs
, 2020 Let n, k, r be positive integers, with n ≥ kr. The r-uniform Kneser hypergraph KG r(n, k) has as vertex set the set of all k-subsets of the set {1,…,n} and its (hyper) edges are formed by the r-tuples of pairwise disjoint k-subsets of the set {1,…,n}. In
Valencia-pabon, Mario +7 more
core +1 more source
On the Volterra integral equation and axiomatic measures of weak noncompactness [PDF]
, 2001 summary:We prove that a set of weak solutions of the nonlinear Volterra integral equation has the Kneser property.
Bugajewski, Dariusz
core +1 more source
The Coloring of Square of Subgraphs of Kneser Graphs
, 2007 本文所討論的圖形均為簡單圖，即頂點個數有限多個、邊的端點不一樣、邊沒有方向、以及兩個頂點之間最多只有一個邊。 Kneser圖KG(n, k)的點集為集合[N]＝{1,2,3,…,n}中大小為k的所有子集，兩個點有邊相連若且為若這兩個集合互斥。一個圖G的平方記為G2，圖G2是由圖G的點所生成：在圖G中相異兩點的距離不大於2的點都給個邊相連。在第二節中我們證明，當k>2時，圖KG2(2k+1, k)的著色數可以從 已知的4k+2降為3k+2。緊緻Kneser圖KG2(n, k)是Kneser圖KG(n,
陳俊佑, Chen, Jun-Yo
core
$s$-Stable Kneser Graph are Hamiltonian [PDF]
The Kneser Graph $K(n,k)$ has as vertices all $k$-subsets of $\{1,\ldots,n\}$ and edges connecting two vertices if they are disjoint. The $s$-stable Kneser Graph $K_{s-stab}(n, k)$ is obtained from the Kneser graph by deleting vertices with elements at ...
Pastine, Adrián G. +1 more
core +1 more source