Výsledky vyhledávání - "Vardanyan , Gagik"

Report

On the Gasca-Maeztu conjecture for $n=6$

Autor: Hakopian, Hakop, Vardanyan, Gagik, Vardanyan, Navasard

A two-dimensional $n$-correct set is a set of nodes admitting unique bivariate interpolation with polynomials of total degree at most ~$n$. We are interested in correct sets with the property that all fundamental polynomials are products of linear fa

Externí odkaz: http://arxiv.org/abs/2208.06784

Zobrazit plný text záznamu

Report

On two consequences of Berge-Fulkerson conjecture

Autor: Mkrtchyan, Vahan V., Vardanyan, Gagik N.

The classical Berge-Fulkerson conjecture states that any bridgeless cubic graph $G$ admits a list of six perfect matchings such that each edge of $G$ belongs to two of the perfect matchings from the list. In this short note, we discuss two statements

Externí odkaz: http://arxiv.org/abs/1805.06828

Zobrazit plný text záznamu

Report

On strongly spanning $k$-edge-colorable subgraphs

Autor: Mkrtchyan, Vahan V., Vardanyan, Gagik N.

A subgraph $H$ of a multigraph $G$ is called strongly spanning, if any vertex of $G$ is not isolated in $H$, while it is called maximum $k$-edge-colorable, if $H$ is proper $k$-edge-colorable and has the largest size. We introduce a graph-parameter $

Externí odkaz: http://arxiv.org/abs/1107.4879

Zobrazit plný text záznamu

Report

On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs

Autor: Aslanyan, Davit, Mkrtchyan, Vahan V., Petrosyan, Samvel S., Vardanyan, Gagik N.

Publikováno v: Discrete Applied Mathematics 172 (2014) pp. 12--27

We show that any $2-$factor of a cubic graph can be extended to a maximum $3-$edge-colorable subgraph. We also show that the sum of sizes of maximum $2-$ and $3-$edge-colorable subgraphs of a cubic graph is at least twice of its number of vertices. F

Externí odkaz: http://arxiv.org/abs/0909.2767

Zobrazit plný text záznamu

Report

On disjoint matchings in cubic graphs

Autor: Mkrtchyan, Vahan V., Petrosyan, Samvel S., Vardanyan, Gagik N.

Publikováno v: Discrete Mathematics, 310/10-11 (2010), pp. 1588-1613

For $i=2,3$ and a cubic graph $G$ let $\nu_{i}(G)$ denote the maximum number of edges that can be covered by $i$ matchings. We show that $\nu_{2}(G)\geq {4/5}| V(G)| $ and $\nu_{3}(G)\geq {7/6}| V(G)| $. Moreover, it turns out that $\nu_{2}(G)\leq \f

Externí odkaz: http://arxiv.org/abs/0803.0134

Zobrazit plný text záznamu