Results 151 to 160 of about 58,072 (195)
Interrelations of graph distance measures based on topological indices. [PDF]
PLoS One, 2014 Dehmer M, Emmert-Streib F, Shi Y.
europepmc +1 more source
Almost Optimal Upper Bound for the Ground State Energy of a Dilute Fermi Gas via Cluster Expansion. [PDF]
Ann Henri PoincareLauritsen AB.
europepmc +1 more source
Reaction systems and extremal combinatorics properties
Theoretical Computer Science, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luca Manzoni, Enrico Formenti
exaly +7 more sources
Extremal Combinatorics of Reaction Systems
Lecture Notes in Computer Science, 2014 Extremal combinatorics is the study of the size that a certain collection of objects must have in order to certainly satisfy a property. Reaction systems are a recent formalism for computation inspired by chemical reactions. This work is a first contribution to the study of the behaviour of large reaction systems by means of extremal combinatorics.
Luca Manzoni +2 more
exaly +6 more sources
A path forward: Tropicalization in extremal combinatorics
Advances in Mathematics, 2022 Many important problems in extremal combinatorics can be be stated as proving a pure binomial inequality in graph homomorphism numbers, i.e., proving that hom$(H_1,G)^{a_1}\cdots$hom$(H_k,G)^{a_k}\geq$hom$(H_{k+1},G)^{a_{k+1}}\cdots$hom$(H_m,G)^{a_m}$ holds for some fixed graphs $H_1,\dots,H_m$ and all graphs $G$.
Annie Raymond, Grigoriy Blekherman
exaly +4 more sources