#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1978

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Antal Iványi
- ArXiv
- 2010

Let a, b and n be nonnegative integers (b ≥ a, b > 0, n ≥ 1), Gn(a, b) be a multigraph on n vertices in which any pair of vertices is connected with at least a and at most b edges and v = (v1, v2, .… (More)

- Antal Iványi, Antal Iványi
- 2012

Let a, b and n be integers, n ≥ 1 and b ≥ a ≥ 0. Let an (a, b, n)-graph defined as a loopless graph G(a, b, n) on n vertices {V1, . . . , Vn}, in which Vi and Vj are connected with at least a and at… (More)

- Antal Iványi
- Discrete Applied Mathematics
- 1989

We construct a periodic array containrng every k-ary m x n array as a subarray exactly once. Using the algorithm SUPER (which for kz3 generates an infinite k-ary sequence whose begmnmg parts of… (More)

- Antal Iványi
- 2010

Let a, b (b ≥ a) and n (n ≥ 2) be nonnegative integers and let T (a, b, n) be the set of such generalized tournaments, in which every pair of distinct players is connected at most with b, and at… (More)

In the paper we report on the parallel enumeration of the degree sequences (their number is denoted by G(n)) and zerofree degree sequences (their number is denoted by (Gz(n)) of simple graphs on n =… (More)

- Shariefuddin Pirzada, Guofei Zhou, Antal Iványi
- ArXiv
- 2010

Given non-negative integers ni and αi with 0 ≤ αi ≤ ni (i = 1, 2, . . . , k), an [α1, α2, . . . , αk]-k-partite hypertournament on ∑k 1 ni vertices is a (k+ 1)-tuple (U1, U2, . . . , Uk, E), where Ui… (More)

- Márk Horváth, Antal Iványi
- Discrete Mathematics
- 2008

An (n, a, b)-perfect double cube is a b× b× b sized n-ary periodic array containing all possible a × a × a sized n-ary array exactly once as subarray. A growing cube is an array whose cj × cj × cj… (More)

- Antal Iványi, Balázs Novák
- ArXiv
- 2010

Let ξ be a random integer vector, having uniform distribution P{ξ = (i1, i2, . . . , in) = 1/n} for 1 ≤ i1, i2, . . . , in ≤ n. A realization (i1, i2, . . . , in) of ξ is called good, if its elements… (More)

- Peter Fornai, Antal Iványi
- ArXiv
- 2010

Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page frames increases. Belady, Nelson… (More)

- Antal Iványi
- Morphologiai es igazsagugyi orvosi szemle
- 1990

Author surveys literature of pathology and medical informatics of last 25 years regarding pathological information systems. He studies changes of used hardware and software means related to… (More)