HUN-REN Alfréd Rényi Institute of Mathematics

output

19942026

most citedBrownian distance covariance

857 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2015 · math.COShow all

20 papers · 2 filters

math.CO2015

A Combinatorial Problem Related to Sparse Systems of Equations

Peter Horak, Igor Semaev, Zsolt Tuza

Nowadays sparse systems of equations occur frequently in science and engineering. In this contribution we deal with sparse systems common in cryptanalysis. Given a cipher system, o…

math.CO2015★ 2 cited

$F$ -WORM colorings: Results for 2-connected graphs

Csilla Bujtás, Zsolt Tuza

Given two graphs $F$ and $G$ , an $F$ -WORM coloring of $G$ is an assignment of colors to its vertices in such a way that no $F$ -subgraph of $G$ is monochromatic or rainbow. If $G$ h…

math.CO2015★ 6 cited

Chromatic roots and limits of dense graphs

Peter Csikvari, Peter E. Frenkel, Jan Hladky +1

In this short note we observe that recent results of Abert and Hubai and of Csikvari and Frenkel about Benjamini--Schramm continuity of the holomorphic moments of the roots of the…

math.CO2015★ 35 cited

Partitioning 2-edge-colored graphs by monochromatic paths and cycles

Jozsef Balogh, Janos Barat, Daniel Gerbner +2

We present results on partitioning the vertices of $2$ -edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of Sárköz…

math.CO2015★ 33 cited

Vertex covers by monochromatic pieces - A survey of results and problems

Andras Gyarfas

This survey is devoted to problems and results concerning covering the vertices of edge colored graphs or hypergraphs with monochromatic paths, cycles and other objects. It is an e…

math.CO2015★ 3 cited

Ramsey number of a connected triangle matching

Andras Gyarfas, Gabor N. Sarkozy

We determine the $2$ -color Ramsey number of a {\em connected} triangle matching $c (n K_{3})$ which is any connected graph containing $n$ vertex disjoint triangles. We obtain that $R(c…

math.CO2015★ 2 cited

Large Cross-free sets in Steiner triple systems

Andras Gyarfas

A {\em cross-free} set of size $m$ in a Steiner triple system $(V, B)$ is three pairwise disjoint $m$ -element subsets $X_{1}, X_{2}, X_{3} \subset V$ such that no $B \in B$ in…

math.CO2015★ 2 cited

Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem

Ervin Győri, Tamás Róbert Mezei

We prove that every simply connected orthogonal polygon of $n$ vertices can be partitioned into $⌊ \frac{3 n + 4}{16} ⌋$ (simply connected) orthogonal polygons…

math.CO2015

Separation with restricted families of sets

Zsolt Lángi, Márton Naszódi, János Pach +2

Given a finite $n$ -element set $X$ , a family of subsets $F \subset 2^{X}$ is said to separate $X$ if any two elements of $X$ are separated by at least one member of $\mathc…

math.CO2015★ 13 cited

A modified bootstrap percolation on a random graph coupled with a lattice

Svante Janson, Robert Kozma, Miklós Ruszinkó +1

In this paper a random graph model $G_{Z_{N}^{2}, p_{d}}$ is introduced, which is a combination of fixed torus grid edges in $(Z / N Z)^{2}$ and some additional ran…

math.CO2015★ 1 cited

Stability in the Erdos--Gallai Theorem on cycles and paths

Zoltán Füredi, Alexandr Kostochka, Jacques Verstraëte

The Erdős-Gallai Theorem states that for $k \geq 2$ , every graph of average degree more than $k - 2$ contains a $k$ -vertex path. This result is a consequence of a stronger result o…

math.CO2015★ 2 cited

A note on tilted Sperner families with patterns

Dániel Gerbner, Máté Vizer

Let $p$ and $q$ be two nonnegative integers with $p + q > 0$ and $n > 0$ . We call $F \subset P ([n])$ a \textit{(p,q)-tilted Sperner family with patterns on [n]} if th…

math.CO2015★ 4 cited

Intersecting $P$ -free families

Dániel Gerbner, Abhishek Methuku, Casey Tompkins

We study the problem of determining the size of the largest intersecting $P$ -free family for a given partially ordered set (poset) $P$ . In particular, we find the exact size of the…

math.CO2015

On the existence of flat orthogonal matrices

Philippe Jaming, Mate Matolcsi

In this note we investigate the existence of flat orthogonal matrices, i.e. real orthogonal matrices with all entries having absolute value close to $\frac{1}{n}$ . Entries o…

math.CO2015★ 4 cited

Rainbow matchings in bipartite multigraphs

János Barát, András Gyárfás, Gábor N. Sárközy

Suppose that $k$ is a non-negative integer and a bipartite multigraph $G$ is the union of $N = ⌊ \frac{k + 2}{k + 1} n ⌋ - (k + 1)$ matchings $M_{1}, \dots, M_{N}$ , each of…

math.CO2015★ 1 cited

More on Decomposing Coverings by Octants

Balázs Keszegh, Dömötör Pálvölgyi

In this note we improve our upper bound given earlier by showing that every 9-fold covering of a point set in the space by finitely many translates of an octant decomposes into two…

math.CO2015

Orientations making k-cycles cyclic

Zita Helle, Gábor Simonyi

We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lcei…

math.CO2015★ 12 cited

Point-curve incidences in the complex plane

Adam Sheffer, Endre Szabó, Joshua Zahl

We prove an incidence theorem for points and curves in the complex plane. Given a set of $m$ points in $R^{2}$ and a set of $n$ curves with $k$ degrees of freedom, Pach and…

math.CO2015

Decompositions of edge-colored infinite complete graphs into monochromatic paths

M. Elekes, D. T. Soukup, L. Soukup +1

An $r$ -edge coloring of a graph or hypergraph $G = (V, E)$ is a map $c : E \to {0, \dots, r - 1}$ . Extending results of Rado and answering questions of Rado, Gyárfás and Sárközy we prove…

math.CO2015

Choosability and paintability of the lexicographic product of graphs

Balázs Keszegh, Xuding Zhu

This paper studies the choice number and paint number of the lexicographic product of graphs. We prove that if $G$ has maximum degree $Δ$ , then for any graph $H$ on $n$ vertices $c…

A Combinatorial Problem Related to Sparse Systems of Equations

F-WORM colorings: Results for 2-connected graphs

Chromatic roots and limits of dense graphs

Partitioning 2-edge-colored graphs by monochromatic paths and cycles

Vertex covers by monochromatic pieces - A survey of results and problems

Ramsey number of a connected triangle matching

Large Cross-free sets in Steiner triple systems

Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem

Separation with restricted families of sets

A modified bootstrap percolation on a random graph coupled with a lattice

Stability in the Erdos--Gallai Theorem on cycles and paths

A note on tilted Sperner families with patterns

Intersecting P-free families

On the existence of flat orthogonal matrices

Rainbow matchings in bipartite multigraphs

More on Decomposing Coverings by Octants

Orientations making k-cycles cyclic

Point-curve incidences in the complex plane

Decompositions of edge-colored infinite complete graphs into monochromatic paths

Choosability and paintability of the lexicographic product of graphs

$F$ -WORM colorings: Results for 2-connected graphs

Intersecting $P$ -free families