Results 41 to 50 of about 509,375 (328)
European Journal of Combinatorics, 2019 Classical problems in hypergraph coloring theory are to estimate the minimum number of edges, $m_2(r)$ (respectively, $m^\ast_2(r)$), in a non-$2$-colorable $r$-uniform (respectively, $r$-uniform and simple) hypergraph. The best currently known bounds are \[c \cdot \sqrt{r/\log r} \cdot 2^r \,\leqslant\, m_2(r) \,\leqslant\, C \cdot r^2 \cdot 2^r ...
Anton Bernshteyn, Alexandr V. Kostochka
openaire +4 more sources
Alexithymia and dissociation in personality disorders: a retrospective cross-sectional study
European Psychiatry, 2022 Introduction Patients with “personality disorder”, has history of traumatic life events and are predisposed to develop alexithymia and dissociation, considered as risk factor for severity.
M. Pacetti, D. Salmaso
doaj +1 more source
A note on a Brooks' type theorem for DP‐coloring [PDF]
Journal of Graph Theory, 2017 Dvořák and Postle introduced DP‐coloring of simple graphs as a generalization of list‐coloring. They proved a Brooks' type theorem for DP‐coloring; and Bernshteyn, Kostochka, and Pron extended it to DP‐coloring of multigraphs. However, detailed structure,
Seog-Jin Kim, K. Ozeki
semanticscholar +1 more source
A sufficient condition for DP-4-colorability [PDF]
Discrete Mathematics, 2017 DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed coloring of signed graphs. It is known that for each $k \in \{3, 4, 5, 6\}$, every planar graph without $C_k$ is 4-choosable.
Seog-Jin Kim, K. Ozeki
semanticscholar +1 more source
Receiver section of the proposed 10 × 400 Gbps WDM-MDM-DP-QPSKIs-OWC system.
, 2022 Receiver section of the proposed 10 × 400 Gbps WDM-MDM-DP-QPSKIs-OWC system.
Lunchakorn Wuttisittikulkij (9707288) +5 more
core +1 more source
DP-colorings of graphs with high chromatic number [PDF]
European journal of combinatorics (Print), 2017 DP-coloring is a generalization of list coloring introduced recently by Dvořak and Postle (2015). We prove that for every n -vertex graph G whose chromatic number χ ( G ) is “close” to n , the DP-chromatic number of G equals χ ( G ) . “Close” here means
Anton Bernshteyn +2 more
semanticscholar +1 more source
On DP-coloring of graphs and multigraphs [PDF]
Siberian mathematical journal, 2016 While solving a question on the list coloring of planar graphs, Dvořák and Postle introduced the new notion of DP-coloring (they called it correspondence coloring).
Anton Bernshteyn +2 more
semanticscholar +1 more source
Proceedings of the sixth conference on Applied natural language processing -, 2000 This paper describes and evaluates a detector of presuppositions (DP) for survey questions. Incorrect presuppositions can make it difficult to answer a question correctly. Since they can be difficult to detect, DP is a useful tool for questionnaire designer. DP performs well using local characteristics of presuppositions.
Katja Wiemer-Hastings +2 more
openaire +1 more source
Tahakkümden Denetime: 1924-1960 Yılları Arasında Türkiye’de Uygulanan Din Politikaları [PDF]
İnsan & ToplumTürkiye, 23 Nisan 1920 tarihinde ulusal egemenliğini ilan ettikten sonra din ile uyumlu politikalar takip etmiştir. Bu dönemde devletin, din politikaları konusunda intibak/uyum paradigması çerçevesinde hareket ettiği söylenebilir.
Hüseyin
doaj +1 more source
A subset of HLA-DP molecules serve as ligands for the natural cytotoxicity receptor NKp44
Nature Immunology, 2019 Natural killer (NK) cells can recognize virus-infected and stressed cells1 using activating and inhibitory receptors, many of which interact with HLA class I.
Annika Niehrs +15 more
semanticscholar +1 more source