Results 21 to 30 of about 563,274 (244)
Antimatroids and Balanced Pairs [PDF]
, 2013 We generalize the 1/3-2/3 conjecture from partially ordered sets to antimatroids: we conjecture that any antimatroid has a pair of elements x,y such that x has probability between 1/3 and 2/3 of appearing earlier than y in a uniformly random basic word ...
Eppstein, David
core +1 more source
An extremal problem on potentially K_p,1,1-graphic sequences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A sequence S is potentially K_p,1,1 graphical if it has a realization containing a K_p,1,1 as a subgraph, where K_p,1,1 is a complete 3-partite graph with partition sizes p,1,1.
Chunhui Lai
doaj +1 more source
On a conjecture for the difference equation $ x_{n+1} = 1+p\frac{x_{n-m}}{x_n^2} $
AIMS Mathematics, 2023 In [24], E. Tasdemir, et al. proved that the positive equilibrium of the nonlinear discrete equation $ x_{n+1} = 1+p\frac{x_{n-m}}{x_n^2} $ is globally asymptotically stable for $ p\in(0, \frac{1}{2}) $, {locally} asymptotically stable for $ p\in(\frac{1}
George L. Karakostas
doaj +1 more source
On minimizing the maximum color for the 1–2–3 Conjecture
Discrete Applied Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bensmail, Julien +3 more
openaire +3 more sources
On a List Variant of the Multiplicative 1-2-3 Conjecture
Graphs and Combinatorics, 2022 The 1-2-3 Conjecture asks whether almost all graphs can be (edge-)labelled with $1,2,3$ so that no two adjacent vertices are incident to the same sum of labels. In the last decades, several aspects of this problem have been studied in literature, including more general versions and slight variations.
Bensmail, Julien +3 more
openaire +4 more sources
Zeros of the Partition Function for Higher--Spin 2D Ising Models [PDF]
, 1995 We present calculations of the complex-temperature zeros of the partition functions for 2D Ising models on the square lattice with spin $s=1$, 3/2, and 2.
A J Guttmann +24 more
core +3 more sources
The web of swampland conjectures and the TCC bound
Journal of High Energy Physics, 2020 We consider the swampland distance and de Sitter conjectures, of respective order one parameters λ and c. Inspired by the recent Trans-Planckian Censorship conjecture (TCC), we propose a generalization of the distance conjecture, which bounds λ to be a ...
David Andriot +2 more
doaj +1 more source
1-2-3 Conjecture in digraphs: More results and directions
Discrete Applied Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bensmail, Julien, Lyngsie, Kasper
openaire +5 more sources
Asymmetric exclusion model with several kinds of impurities [PDF]
, 2012 We formulate a new integrable asymmetric exclusion process with $N-1=0,1,2,...$ kinds of impurities and with hierarchically ordered dynamics. The model we proposed displays the full spectrum of the simple asymmetric exclusion model plus new levels.
Alcaraz F C +13 more
core +2 more sources
Decomposability of graphs into subgraphs fulfilling the 1–2–3 Conjecture [PDF]
Discrete Applied Mathematics, 2019 The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every $d$-regular graph, $d\geq 2$, can be decomposed into at most $2$ subgraphs (without isolated edges) fulfilling the 1 ...
Bensmail, Julien, Przybyƚo, Jakub
openaire +3 more sources