Results 201 to 210 of about 9,658 (272)

Feedback-integrated prompt optimiser for problem formulation. [PDF]

Sci Rep
Amarasinghe PT, Nguyen S, Sun Y, Alahakoon D.   +3 more
europepmc   +1 more source

On Strongly and Robustly Critical Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k $k$‐critical yet L $L$‐colorable with ...
Anton Bernshteyn, Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma   +3 more
wiley   +1 more source

Unveiling a novel S-Box strategy: The dynamic 3D scrambling approach. [PDF]

PLoS One
Ahmad Khan N, Banga A, Ghazal TM, Alabdullah B, Iqbal N, Alshamayleh A, Ikram A, Diab H.   +7 more
europepmc   +1 more source

STANCU TYPE GENERALIZATION OF MODIFIED GAMMA OPERATORS BASED ON q-INTEGERS

Bulletin of the Korean Mathematical Society, 2017
Shu-Ni Chen, Wen-Tao Cheng, Xiao-Ming Zeng   +2 more
openaire   +2 more sources

Sensitivity and Hamming Graphs

Journal 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, Yuval Filmus, Ignacio García‐Marco, Kolja Knauer   +3 more
wiley   +1 more source

The χ -Binding Function of <i>d</i>-Directional Segment Graphs. [PDF]

Discrete Comput Geom
Duraj L, Kang RJ, La H, Narboni J, Pokrývka F, Rambaud C, Reinald A.   +6 more
europepmc   +1 more source

Tight Bounds for Hypercube Minor‐Universality

Journal 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, Lukas Michel, Alex Scott, Youri Tamitegama, Jane Tan, Dmitry Tsarev   +5 more
wiley   +1 more source

First high-resolution synchrotron X-ray study of icosahedrite, a natural quasicrystal from the Khatyrka meteorite. [PDF]

IUCrJ
Ishii Y.
europepmc   +1 more source

An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth

Journal of Graph Theory, EarlyView.
ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth.
Marc Distel
wiley   +1 more source

Some New Constructions of q-ary Codes for Correcting a Burst of at Most t Deletions. [PDF]

Entropy (Basel)
Song W, Cai K, Quek TQS.
europepmc   +1 more source