Results 41 to 50 of about 4,692 (164)

Diophantine tuples and product sets in shifted powers

Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract Let k⩾2$k\geqslant 2$ and n≠0$n\ne 0$. A Diophantine tuple with property Dk(n)$D_k(n)$ is a set of positive integers A$A$ such that ab+n$ab+n$ is a k$k$th power for all a,b∈A$a,b\in A$ with a≠b$a\ne b$. Such generalizations of classical Diophantine tuples have been studied extensively.
Ernie Croot, Chi Hoi Yip
wiley   +1 more source

Patterns of Interploidy Admixture in Polyploid Complexes: Insights From Thymus Sect. Mastichina (Lamiaceae)

Molecular Ecology, Volume 35, Issue 3, February 2026.
ABSTRACT Understanding gene flow between ploidy levels in polyploid complexes is essential for species delimitation and conservation. This study explores evolutionary dynamics in the polyploid complex Thymus sect. Mastichina (Lamiaceae), comprising three taxa: T. mastichina subsp. mastichina, T. mastichina subsp.
Francisco José García‐Cárdenas, María Ángeles Ortiz, José Carlos del Valle, David Doblas‐Pruvost, Manuel de la Estrella, Diego Nieto‐Lugilde, Lisa Pokorny, Regina Berjano   +7 more
wiley   +1 more source

Secure Authentication via Quantum Physical Unclonable Functions: A Review

Advanced Quantum Technologies, Volume 9, Issue 1, January 2026.
This in‐depth review article examines the origins, development, and evolution of Quantum Physical Unclonable Functions (QPUFs), with a particular focus on their use in secure authentication. The topic is motivated and introduced in detail, addressing both theoretical foundations and practical implementations, and is supported by a systematic article ...
Pol Julià Farré, Vladlen Galetsky, Mohamed Belhassen, Gregor Pieplow, Kumar Nilesh, Holger Boche, Tim Schröder, Janis Nötzel, Christian Deppe   +8 more
wiley   +1 more source

New directions in Ramsey theory [PDF]

Discrete Mathematics Letters, 2021
Gary Chartrand, Ping Zhang
doaj   +1 more source

The k-Ramsey number of two five cycles

AKCE International Journal of Graphs and Combinatorics
Given any two graphs F and H, the Ramsey number R(F, H) is defined as the smallest positive integer n such that every red-blue coloring of the edges of the complete graph Kn of order n, there will be a subgraph of Kn isomorphic to F whose edges are all ...
Johannes H. Hattingh, Elizabeth Jonck, Ronald J. Maartens   +2 more
doaj   +1 more source

Zarankiewicz Numbers and Bipartite Ramsey Numbers

, 2016
15 ...
Collins, Alex F., Riasanovsky, Alexander W. N., Wallace, John C., Radziszowski, Stanis law P.   +3 more
openaire   +2 more sources

Minimum Degrees of Minimal Ramsey Graphs for Almost-Cliques

, 2014
For graphs $F$ and $H$, we say $F$ is Ramsey for $H$ if every $2$-coloring of the edges of $F$ contains a monochromatic copy of $H$. The graph $F$ is Ramsey $H$-minimal if $F$ is Ramsey for $H$ and there is no proper subgraph $F'$ of $F$ so that $F'$ is ...
Grinshpun, Andrey, Raina, Raj, Sengupta, Rik   +2 more
core   +1 more source

Consequences of the Megafauna Extinction: Changes in Food Web Networks on the Edwards Plateau Across the Pleistocene–Holocene Transition

Global Ecology and Biogeography, Volume 34, Issue 12, December 2025.
ABSTRACT Aims Today, we are experiencing rapid biodiversity loss due to climate change and human impacts. Such biodiversity loss is not only harmful to the environment but can also alter the composition of communities and the interactions of their members.
Quentin A. Smith, Catalina P. Tomé, William Gearty, Felisa A. Smith, Daizaburo Shizuka, S. Kathleen Lyons   +5 more
wiley   +1 more source

Extremal theory and bipartite graph-tree Ramsey numbers

Discrete Mathematics, 1988
The authors contribute to the extremal Ramsey theory on graphs. In particular Ramsey numbers for trees and bipartite graphs are upperbounded. Tecnical mechanism developed for proving the main result is interesting in its own right and seems to be useful for further researches.
Erd'́os, P., Faudree, R.J., Rousseau, C.C., Schelp, R.H.   +3 more
openaire   +1 more source

Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth

Journal of Graph Theory, Volume 110, Issue 3, Page 351-365, November 2025.
ABSTRACT Even‐hole‐free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer t ≥ 4 and a graph H, every even‐hole‐free graph of large enough treewidth has an induced subgraph isomorphic to either K t or H, if (and only if) H
Sepehr Hajebi
wiley   +1 more source