Ervin Györi

According to our database1, Ervin Györi authored at least 60 papers between 1978 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs.
J. Comb. Theory, Ser. A, 2019

Mobile versus Point Guards.
Discrete & Computational Geometry, 2019

2018
3-Uniform Hypergraphs and Linear Cycles.
SIAM J. Discrete Math., 2018

On the Turán number of some ordered even cycles.
Eur. J. Comb., 2018

An Erdős-Gallai type theorem for uniform hypergraphs.
Eur. J. Comb., 2018

On the maximum size of connected hypergraphs without a path of given length.
Discrete Mathematics, 2018

Terminal-pairability in complete bipartite graphs.
Discrete Applied Mathematics, 2018

A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy.
Electr. J. Comb., 2018

2017
On the number of edge-disjoint triangles in K4-free graphs.
Electronic Notes in Discrete Mathematics, 2017

A note on the maximum number of triangles in a C5-free graph.
Electronic Notes in Discrete Mathematics, 2017

3-uniform hypergraphs and linear cycles.
Electronic Notes in Discrete Mathematics, 2017

Note on terminal-pairability in complete grid graphs.
Discrete Mathematics, 2017

On the Number of Edge-Disjoint Triangles in K 4-Free Graphs.
Combinatorica, 2017

2016
Hypergraph extensions of the Erdős-Gallai Theorem.
Eur. J. Comb., 2016

A list version of graph packing.
Discrete Mathematics, 2016

Making a C6-free graph C4-free and bipartite.
Discrete Applied Mathematics, 2016

Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem.
Comput. Geom., 2016

2015
Optimal pebbling of grids.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Preface.
Eur. J. Comb., 2014

2012
Efficient algorithms for the periodic subgraphs mining problem.
J. Discrete Algorithms, 2012

Hypergraphs with no cycle of length 4.
Discrete Mathematics, 2012

Hypergraphs with No Cycle of a Given Length.
Combinatorics, Probability & Computing, 2012

The Maximum Number of Triangles in C2k+1-Free Graphs.
Combinatorics, Probability & Computing, 2012

3-uniform hypergraphs avoiding a given odd cycle.
Combinatorica, 2012

2011
Preface.
Electronic Notes in Discrete Mathematics, 2011

Coloring vertices and edges of a graph by nonempty subsets of a set.
Eur. J. Comb., 2011

2010
Hypergraph Extensions of the Erdos-Gallai Theorem.
Electronic Notes in Discrete Mathematics, 2010

On a problem of Erdos on integers, none of which divides the product of k others.
Eur. J. Comb., 2010

Cyclability in k-connected K1, 4-free graphs.
Discrete Mathematics, 2010

2009
Hypergraphs with no odd cycle of given length.
Electronic Notes in Discrete Mathematics, 2009

A new type of edge-derived vertex coloring.
Discrete Mathematics, 2009

2008
General neighbour-distinguishing index of a graph.
Discrete Mathematics, 2008

Guest Editors' Foreword.
Discrete Mathematics, 2008

Pentagons vs. triangles.
Discrete Mathematics, 2008

Connected graphs without long paths.
Discrete Mathematics, 2008

2007
Adjacent Vertex Distinguishing Edge-Colorings.
SIAM J. Discrete Math., 2007

2006
Triangle-Free Hypergraphs.
Combinatorics, Probability & Computing, 2006

2005
An extremal problem concerning graphs not containing Kt and Kt, t, t.
Discrete Mathematics, 2005

2004
Longest Paths in Circular Arc Graphs.
Combinatorics, Probability & Computing, 2004

2003
Nearly bipartite graphs.
Discrete Mathematics, 2003

2002
Two-edge colorings of graphs with bounded degree in both colors.
Discrete Mathematics, 2002

2001
On the Strong Product of a k-Extendable and an l-Extendable Graph.
Graphs and Combinatorics, 2001

2000
Vertex-Disjoint Cycles Containing Specified Edges.
Graphs and Combinatorics, 2000

1999
How to make a graph four-connected.
Math. Program., 1999

1997
Graphs without short odd cycles are nearly bipartite.
Discrete Mathematics, 1997

C6-free bipartite graphs and product representation of squares.
Discrete Mathematics, 1997

1994
Generalized Guarding and Partitioning for Rectilinear Polygons.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1992
The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable.
Discrete Mathematics, 1992

1991
An Extremal Problem on Sparse 0-1 Matrices.
SIAM J. Discrete Math., 1991

On the maximal number of certain subgraphs inKr-free graphs.
Graphs and Combinatorics, 1991

On the number of edge disjoint cliques in graphs of given size.
Combinatorica, 1991

1989
On the number of C5's in a triangle-free graph.
Combinatorica, 1989

1988
Average distance in graphs with removed elements.
Journal of Graph Theory, 1988

1986
The number of small semispaces of a finite set of points in the plane.
J. Comb. Theory, Ser. A, 1986

1985
Covering simply connected regions by rectangles.
Combinatorica, 1985

1984
A minimax theorem on intervals.
J. Comb. Theory, Ser. B, 1984

1981
An n-dimensional search problem with restricted questions.
Combinatorica, 1981

Partition conditions and vertex-connectivity of graphs.
Combinatorica, 1981

1978
A theorem of the transversal theory for matroids of finite character.
Discrete Mathematics, 1978

On the structures induced by bipartite graphs and infinite matroids.
Discrete Mathematics, 1978


  Loading...