András Gyárfás

activity

20142021

3

-graphs

2 citations · 5 across the 7 of their papers we have counts for

collaborators

9 papers

math.CO2021★ 2 cited

Crowns in linear $3$ -graphs

Alvaro Carbonero, Willem Fletcher, Jing Guo +3

A \textit{linear $3$ -graph}, $H = (V, E)$ , is a set, $V$ , of vertices together with a set, $E$ , of $3$ -element subsets of $V$ , called edges, so that any two distinct edges intersec…

math.CO2021

Turán number of special four cycles in triple systems

Zoltán Füredi, András Gyárfás, Attila Sali

A {\em special four-cycle } $F$ in a triple system consists of four triples {\em inducing } a $C_{4}$ . This means that $F$ has four special vertices $v_{1}, v_{2}, v_{3}, v_{4}$ and four triple…

math.CO2021

Covering 2-colored complete digraphs by monochromatic $d$ -dominating digraphs

Louis DeBiasio, András Gyárfás

A digraph is {\em $d$ -dominating} if every set of at most $d$ vertices has a common out-neighbor. For all integers $d \geq 2$ , let $f (d)$ be the smallest integer such that the verti…

math.CO2019

Problems and results on 1-cross intersecting set pair systems

Zoltán Füredi, András Gyárfás, Zoltán Király

The notion of cross intersecting set pair system of size $m$ , $({A_{i}}_{i = 1}^{m}, {B_{i}}_{i = 1}^{m})$ with $A_{i} \cap B_{i} = \emptyset$ and $A_{i} \cap B_{j} \neq = \emptyset$ , was introduce…

math.CO2018

Partitioning the power set of $[n]$ into $C_{k}$ -free parts

Eben Blaisdell, András Gyárfás, Robert A. Krueger +1

We show that for $n \geq 3, n \neq = 5$ , in any partition of $P (n)$ , the set of all subsets of $[n] = {1, 2, \dots, n}$ , into $2^{n - 2} - 1$ parts, some part must contain a triangl…

math.CO2018

Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs

Louis DeBiasio, András Gyárfás, Robert A. Krueger +2

It is well-known that in every $r$ -coloring of the edges of the complete bipartite graph $K_{n, n}$ there is a monochromatic connected component with at least $\frac{2 n}{r}$ vertices…

math.CO2017★ 2 cited

Uniquely $K_{r}^{(k)}$ -saturated Hypergraphs

András Gyárfás, Stephen G. Hartke, Charles Viss

In this paper we generalize the concept of uniquely $K_{r}$ -saturated graphs to hypergraphs. Let $K_{r}^{(k)}$ denote the complete $k$ -uniform hypergraph on $r$ vertices. For integers…

math.CO2017★ 1 cited

The linear Turán number of the k-fan

Zoltán Füredi, András Gyárfás

A hypergraph is linear if any two edges intersect in at most one vertex. For a fixed $k$ -uniform family $F$ of hypergraphs, the linear Turán number ${\rm ex}_{\rm lin}(n,{\…

math.CO2014

On $3$ -uniform hypergraphs without linear cycles

András Gyárfás, Ervin Győri, Miklós Simonovits

We explore properties of $3$ -uniform hypergraphs $H$ without linear cycles. Our main results are that these hypergraphs must contain a vertex of strong degree at most two and must…

Crowns in linear 3-graphs

Turán number of special four cycles in triple systems

Covering 2-colored complete digraphs by monochromatic d-dominating digraphs