Z. Füredi

activity

19992026

most citedExtremal numbers for odd cycles

45 citations · 106 across the 36 of their papers we have counts for

collaborators

Showing 2017Show all

5 papers · 1 filter

math.CO2017

Hypergraphs not containing a tight tree with a bounded trunk

Zoltán Füredi, Tao Jiang, Alexandr Kostochka +2

An $r$ -uniform hypergraph is a tight $r$ -tree if its edges can be ordered so that every edge $e$ contains a vertex $v$ that does not belong to any preceding edge and the set $e - v$ …

math.CO2017★ 1 cited

Tight paths in convex geometric hypergraphs

Zoltán Füredi, Tao Jiang, Alexandr Kostochka +2

In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generali…

math.CO2017

List-Distinguishing Cartesian Products of Cliques

Michael Ferrara, Zoltan Furedi, Sogol Jahanbekam +1

The distinguishing number of a graph $G$ , denoted $D (G)$ , is the minimum number of colors needed to produce a coloring of the vertices of $G$ so that every nontrivial isomorphism i…

math.CO2017

Stability in the Erdős--Gallai Theorem on cycles and paths, II

Zoltán Füredi, Alexandr Kostochka, Ruth Luo +1

The Erdős--Gallai Theorem states that for $k \geq 3$ , any $n$ -vertex graph with no cycle of length at least $k$ has at most $\frac{1}{2} (k - 1) (n - 1)$ edges. A stronger version of the…

math.CO2017

Extensions of a theorem of Erdős on nonhamiltonian graphs

Zoltán Füredi, Alexandr Kostochka, Ruth Luo

Let $n, d$ be integers with $1 \leq d \leq ⌊ \frac{n - 1}{2} ⌋$ , and set $h (n, d) := (2 n - d) + d^{2}$ . Erdős proved that when $n \geq 6 d$ , each nonhamilto…