Results 171 to 180 of about 207,710 (268)

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

Orientability of undirected phylogenetic networks to a desired class: practical algorithms and application to tree-child orientation. [PDF]

Algorithms Mol Biol
Urata T, Yokoyama M, Miyaji H, Hayamizu M.   +3 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

Stable Boundaries of Opinion Dynamics in Heterogeneous Spatial Complex Networks. [PDF]

Entropy (Basel)
Bierwirth M, Lengler J.
europepmc   +1 more source

Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number

Journal of Graph Theory, EarlyView.
ABSTRACT We continue the study of ( tw , ω ) $({\mathsf{tw}},\omega )$‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by ...
Claire Hilaire, Martin Milanič, Ðorđe Vasić   +2 more
wiley   +1 more source

From graph theory to chemoinformatics: modified bond-based indices and a hypothesis-driven multi-task QSAR/QSPR benchmark. [PDF]

Sci Rep
Altairi A, Alhaj Z, Alsharafi M, Zeren Y.   +3 more
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

Simplex polynomial in complex networks and its applications to compute the Euler characteristic. [PDF]

Front Comput Neurosci
Wang Z, Fu X, Deng B, Chen Y, Zhao H.
europepmc   +1 more source

Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree

Journal of Graph Theory, EarlyView.
ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) $\text{fas}(D)$ denote the minimum size of a feedback arc set in an oriented multigraph D $D$. In several papers, upper bounds for fas ( D ) $\text{fas}(D)$ were obtained for oriented multigraphs D $D$ with maximum degree upper‐bounded by a constant ...
Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou   +3 more
wiley   +1 more source

Characterizing semi-directed phylogenetic networks and their multi-rootable variants. [PDF]

Theory Biosci
Holtgrefe N, Huber KT, van Iersel L, Jones M, Moulton V.   +4 more
europepmc   +1 more source