A. Jafari

activity

20052022

most citedAlgebraic cycles and motivic generic iterated integrals

1 citations · 3 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2022

On the Frobenius Coin Problem in Three Variables

Negin Bagherpour, Amir Jafari, Amin Najafi Amin

The Frobenius coin problem in three variables, for three positive relatively prime integers $a_{1} < a_{2} < a_{3}$ asks to find the largest number not representable as $a_1x_1+a_2x_2+a_3x…

math.CO2020

Lower bounds for the chromatic number of certain Kneser-type hypergraphs

Soheil Azarpendar, Amir Jafari

Let $n \geq 1$ , $r \geq 2$ , and $s \geq 0$ be integers and $P = {P_{1}, \dots, P_{l}}$ be a partition of $[n] = {1, \dots, n}$ with $∣ P_{i} ∣ \leq r$ for $i = 1, \dots, l$ . Also, let $F$ b…

math.CO2020

On the chromatic number of almost stable general Kneser hypergraphs

Amir Jafari

Let $n \geq 1$ and $s \geq 1$ be integers. An almost $s$ -stable subset $A$ of $[n] = {1, \dots, n}$ is a subset such that for any two distinct elements $i, j \in A$ , one has $∣ i - j ∣ \geq s$ .…

math.CO2020

On some topological and combinatorial lower bounds on chromatic number of Kneser type hyper graphs

Soheil Azarpendar, Amir Jafari

In this paper, we prove a generalization of a conjecture of Erdös, about the chromatic number of certain Kneser-type hypergraphs. For integers $n, k, r, s$ with $n \geq r k$ and $2\le s\…

math.CO2018

Upper bounds for domination numbers of graphs using Turán's Theorem and Lovász local lemma

Sharareh Alipour, Amir Jafari

Let $G$ be a connected graph of order $n$ with vertex set $V (G)$ . A subset $S \subseteq V (G)$ is an $(a, b)$ -dominating set if every vertex $v \in S$ is adjacent to at least $a$ verti…

math.CO2017★ 1 cited

On $k$ -tuple and $k$ -tuple total domination numbers of regular graphs

Sharareh Alipour, Amir Jafari, Morteza Saghafian

Let $G$ be a connected graph of order $n$ , whose minimum vertex degree is at least $k$ . A subset $S$ of vertices in $G$ is a $k$ -tuple total dominating set if every vertex of $G$ i…

On the Frobenius Coin Problem in Three Variables

Lower bounds for the chromatic number of certain Kneser-type hypergraphs

On the chromatic number of almost stable general Kneser hypergraphs

On some topological and combinatorial lower bounds on chromatic number of Kneser type hyper graphs

Upper bounds for domination numbers of graphs using Turán's Theorem and Lovász local lemma

On k-tuple and k-tuple total domination numbers of regular graphs

On $k$ -tuple and $k$ -tuple total domination numbers of regular graphs