نتایج جستجو برای: ladder and complete graph

تعداد نتایج: 16878550  

Journal: :Electronic Journal of Combinatorics 2023

By a Riemann function we mean $f:\mathbb{Z}^n\to\mathbb{Z}$ such that $f(\mathbf{d})$ is equals $0$ for $d_1+\cdots+d_n$ sufficiently small, and $d_1+\cdots+d_n+C$ constant, $C$, large. adding $1$ to the Baker-Norine rank of graph, one gets an equivalent function, similarly related functions.
 To each associate $W: \mathbb{Z}^n\to \mathbb{Z}$ via Möbius inversion call weight function. We g...

Journal: :Communications in Mathematical Physics 2019

Journal: :J. Comb. Theory, Ser. B 2013
Gwenaël Joret David R. Wood

Article history: Received 19 May 2011 Available online xxxx

Journal: :European Journal of Combinatorics 2001

Journal: :Discrete Applied Mathematics 1993

Journal: :Journal of Algebraic Combinatorics 2015

Journal: :European Journal of Combinatorics 2019

Journal: :Journal of Scientific Research 2011

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید