Results 221 to 230 of about 2,988 (254)

Tight Bounds for Hypercube Minor‐Universality

Journal of Graph Theory, Volume 112, Issue 4, Page 433-437, August 2026.
ABSTRACT A graph G is m‐minor‐universal if every graph H with at most m edges and no isolated vertices is contained as a minor in G. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c > 0 such that the d‐dimensional hypercube Q d is ( c ⋅ 2 d / d)‐minor‐universal, while there is an absolute constant K > 0 such that Q d ...
Emma Hogan, Lukas Michel, Alex Scott, Youri Tamitegama, Jane Tan, Dmitry Tsarev   +5 more
wiley   +1 more source

Learning Continuous Decomposable Models Using Mutual Information and Statistical Copulas. [PDF]

Entropy (Basel)
Desuó Neto L, de Oliveira Caetano H, de Souza Sant'Anna Fogliatto M, Dias Maciel C.   +3 more
europepmc   +1 more source

Secure Decentralized Key Relaying via Random Walks in Dynamic Semi‐Trusted QKD Networks

Advanced Quantum Technologies, Volume 9, Issue 8, August 2026.
Quantum Key Distribution (QKD) provides point‐to‐point, information‐theoretically secure session keys, but distance limitations require trusted relays between remote parties. Can quantum keys be relayed without trusting every intermediate node or depending on a central controller?
Sergejs Kozlovičs, Krišjānis Petručeņa, Elina Kalnina, Juris Viksna   +3 more
wiley   +1 more source

Ecological opportunity and the onset of polyploid niche expansion waves. [PDF]

Proc Natl Acad Sci U S A
Kauai F, Van de Peer Y, Bonte D.
europepmc   +1 more source

Efficient Circuit Implementations of Continuous-Time Quantum Walks for Quantum Search. [PDF]

Entropy (Basel)
Portugal R, Moqadam JK.
europepmc   +1 more source

Verkko2 integrates proximity-ligation data with long-read De Bruijn graphs for efficient telomere-to-telomere genome assembly, phasing, and scaffolding. [PDF]

Genome Res
Antipov D, Rautiainen M, Nurk S, Walenz BP, Solar SJ, Phillippy AM, Koren S.   +6 more
europepmc   +1 more source

Boosting multiplexing capabilities for error-robust spatial transcriptomic methods using a set exchange approach. [PDF]

Sci Adv
Boström J, Zapaɫa M, Adameyko I.
europepmc   +1 more source

Harvesting more reads from single-cell combinatorial barcoding data with scarecrow. [PDF]

Bioinformatics
Wragg D, Kang E, Morgan MD.
europepmc   +1 more source

Stability of Homomorphisms, Coverings and Cocycles I: Equivalence

Chapman M, Lubotzky A.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the Acyclic Chromatic Number of Hamming Graphs

Graphs and Combinatorics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Jamison, Gretchen Matthews
exaly   +3 more sources