#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2010

2017

- This year (1)
- Last five years (10)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Péter Csikvári, Zoltán Lóránt Nagy
- Combinatorics, Probability & Computing
- 2012

Let H be a graph on n vertices and let the blow-up graph G[H] be defined as follows. We replace each vertex v i of H by a cluster A i and connect some pairs of vertices of A i and A j if (v i , v j) was an edge of the graph H. As usual, we define the edge density between A i and A j as d(A i , A j) = e(A i , A j) |A i ||A j |. We study the following… (More)

- András Gács, Tamás Héger, Zoltán Lóránt Nagy, Dömötör Pálvölgyi
- Finite Fields and Their Applications
- 2010

Starting with a result in combinatorial number theory we prove that (apart from a couple of exceptions that can be classified), for any elements a 1 ,. .. , a n of GF (q), there are distinct field elements b 1 ,. .. , b n such that a 1 b 1 + · · · + a n b n = 0. This implies the classification of hyperplanes lying in the union of the hyperplanes X i = X j… (More)

- Zoltán Lóránt Nagy
- Electr. J. Comb.
- 2011

In this paper we propose a multipartite version of the classical Turán problem of determining the minimum number of edges needed for an arbitrary graph to contain a given subgraph. As it turns out, here the non-trivial problem is the determination of the minimal edge density between two classes that implies the existence of a given subgraph. We determine… (More)

- Zoltán Lóránt Nagy, Balázs Patkós
- Electr. J. Comb.
- 2015

We study the function M (n, k) which denotes the number of maximal k-uniform intersecting families F ⊆ [n] k. Improving a bound of Balogh, Das, Delcourt, Liu and Sharifzadeh on M (n, k), we determine the order of magnitude of log M (n, k) by proving that for any fixed k, M (n, k) = n Θ((2k k)) holds. Our proof is based on Tuza's set pair approach. The main… (More)

- Zoltán Király, Zoltán Lóránt Nagy, Dömötör Pálvölgyi, Mirkó Visontai
- Fundam. Inform.
- 2012

- Younjin Kim, Mohit Kumbhat, Zoltán Lóránt Nagy, Balázs Patkós, Alexey Pokrovskiy, Máté Vizer
- Discrete Applied Mathematics
- 2015

- Zoltán Lóránt Nagy
- Journal of Graph Theory
- 2017

- Raşit Bilgin, Kanat Gürün, +24 authors Javier Juste
- Molecular phylogenetics and evolution
- 2016

The isolation of populations in the Iberian, Italian and Balkan peninsulas during the ice ages define four main paradigms that explain much of the known distribution of intraspecific genetic diversity in Europe. In this study we investigated the phylogeography of a wide-spread bat species, the bent-winged bat, Miniopterus schreibersii around the… (More)

- Zoltán Lóránt Nagy
- Eur. J. Comb.
- 2014

Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements a 1 ,. .. , a m of the cyclic group of order m, there is a permutation π such that 1a π(1) + · · · + ma π(m) = 0.

- Zoltán Lóránt Nagy
- Australasian J. Combinatorics
- 2016

We discuss a variant of the Ramsey and the directed Ramsey problem. First, consider a complete graph on n vertices and a two-coloring of the edges such that every edge is colored with at least one color and the number of bicolored edges |ERB| is given. The aim is to find the maximal size f of a monochromatic clique which is guaranteed by such a coloring.… (More)