Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models. [PDF]
J Math Biol, 2020 Chauve C, Ponty Y, Wallner M.
europepmc +1 more source
The Soifer (formerly Colorado) Mathematical Olympiad, why it was founded, bridge between its problems and mathematics, and lives of its winners: an essay. [PDF]
ZDM, 2022 Soifer A.
europepmc +1 more source
Probabilistic method in extremal combinatorics problems
, 2018 Vjerojatnosna metoda je snažan alat u kombinatorici i teoriji grafova. Osnovni princip vjerojatnosne metode je sljedeći. Želimo pokazati da postoji neki kombinatorni objekt koji zadovoljava neko svojstvo P.
Zec, Ivana
core
The Ramanujan conjecture and its applications. [PDF]
Philos Trans A Math Phys Eng Sci, 2020 Winnie Li WC.
europepmc +1 more source
The growth rate of multicolor Ramsey numbers of 3-graphs. [PDF]
Res Math SciBradač D, Fox J, Sudakov B.
europepmc +1 more source
Long paths and connectivity in 1-independent random graphs. [PDF]
Random Struct Algorithms, 2020 Day AN, Falgas-Ravry V, Hancock R.
europepmc +1 more source
The concept of optimal planning of a linearly oriented segment of the 5G network. [PDF]
PLoS OneKovtun V +3 more
europepmc +1 more source
Best match graphs and reconciliation of gene trees with species trees. [PDF]
J Math Biol, 2020 Geiß M +6 more
europepmc +1 more source
Complexity of linear relaxations in integer programming. [PDF]
Math Program, 2022 Averkov G, Schymura M.
europepmc +1 more source
Extremal, Probabilistic, and Infinitary Problems in Combinatorics
This dissertation consists of an introduction and six chapters, covering a variety of combinatorial problems, with common themes running throughout. Chapter 2 is devoted to the study of partially ordered sets, or posets, in particular the structure of chains and antichains in infinite posets. A poset P is said to satisfy the finite antichain condition,
openaire +1 more source