A. Iványi

activity

20102013

most citedReconstruction of complete interval tournaments

5 citations · 20 across the 9 of their papers we have counts for

collaborators

Showing cs.DMShow all

5 papers · 1 filter

cs.DM2012★ 5 cited

Deciding football sequences

A. Iványi, J. E. Schoenfield

An open problem posed by the first author is the complexity to decide whether a sequence of nonnegative integer numbers can be the final score of a football tournament. In this pap…

cs.DM2011★ 2 cited

On Erdős-Gallai and Havel-Hakimi algorithms

A. Iványi, L. Lucz, T. F. Móri +1

Havel in 1955, Erdős and Gallai in 1960, Hakimi in 1962, Ruskey, Cohen, Eades and Scott in 1994, Barnes and Savage in 1997, Kohnert in 2004, Tripathi, Venugopalan and West in 2010…

cs.DM2011★ 2 cited

Testing of random matrices

Antal Iványi, Imre Kátai

Let $n$ be a positive integer and $X = [x_{ij}]_{1 \leq i, j \leq n}$ be an $n \times n$ \linebreak \noindent sized matrix of independent random variables having joint uniform distr…

cs.DM2010

Score lists in multipartite hypertournaments

Shariefuddin Pirzada, Guofei Zhou, Antal Iványi

Given non-negative integers $n_{i}$ and $α_{i}$ with $0 \leq α_{i} \leq n_{i}$ $(i = 1, 2, ..., k)$ , an $[α_{1}, α_{2}, ..., α_{k}]$ - $k$ -partite hypertournament on $\sum_{1}^{k} n_{i}$ vertic…

cs.DM2010★ 5 cited

Reconstruction of complete interval tournaments

Antal Iványi

Let $a, b$ and $n$ be nonnegative integers $(b \geq a, b > 0, n \geq 1)$ , $G_{n} (a, b)$ be a multigraph on $n$ vertices in which any pair of vertices is connected with a…