According to our database
1,
Ervin Györi
authored at least 105 papers
between 1978 and 2024.
Collaborative distances:
2024
Maximum cliques in a graph without disjoint given subgraph.
Discret. Math., April, 2024
Book free 3-uniform hypergraphs.
Discret. Math., March, 2024
Generalized Turán numbers for the edge blow-up of a graph.
Discret. Math., January, 2024
Extremal Results for Graphs Avoiding a Rainbow Subgraph.
Electron. J. Comb., 2024
2023
Edges Not Covered by Monochromatic Bipartite Graph.
SIAM J. Discret. Math., December, 2023
The maximum number of triangles in Fk-free graphs.
Eur. J. Comb., December, 2023
Turán numbers of Berge trees.
Discret. Math., April, 2023
Generalized outerplanar Turán number of short paths.
Discret. Math., 2023
On the Small Quasi-kernel conjecture.
CoRR, 2023
Subgraph Densities in $K_r$-Free Graphs.
Electron. J. Comb., 2023
Turán Numbers and Anti-Ramsey Numbers for Short Cycles in Complete $3$-Partite Graphs.
Electron. J. Comb., 2023
On $3$-uniform hypergraphs avoiding a cycle of length four.
Electron. J. Comb., 2023
2022
Planar Turán Number of the 6-Cycle.
SIAM J. Discret. Math., September, 2022
On L(2, 1)-labelings of some products of oriented cycles.
Math. Found. Comput., 2022
The maximum number of paths of length three in a planar graph.
J. Graph Theory, 2022
The maximum number of induced C 5 's in a planar graph.
J. Graph Theory, 2022
On L(2, 1)-labelings of oriented graphs.
Discuss. Math. Graph Theory, 2022
The Turán number of the triangular pyramid of 3-layers.
Discret. Appl. Math., 2022
2021
The structure of hypergraphs without long Berge cycles.
J. Comb. Theory, Ser. B, 2021
On the Maximal Colorings of Complete Graphs Without Some Small Properly Colored Subgraphs.
Graphs Comb., 2021
Connected hypergraphs without long Berge-paths.
Eur. J. Comb., 2021
The maximum number of paths of length four in a planar graph.
Discret. Math., 2021
The anti-Ramsey numbers of <i>C</i><sub>3</sub> and <i>C</i><sub>4</sub> in complete <i>r</i>-partite graphs.
Discret. Math., 2021
Wiener index of quadrangulation graphs.
Discret. Appl. Math., 2021
On the anti-Ramsey number of forests.
Discret. Appl. Math., 2021
Generalized Planar Turán Numbers.
Electron. J. Comb., 2021
The Exact Linear Turán Number of the Sail.
Electron. J. Comb., 2021
Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain.
Electron. J. Comb., 2021
2020
Generalized Turán problems for even cycles.
J. Comb. Theory, Ser. B, 2020
The maximum Wiener index of maximal planar graphs.
J. Comb. Optim., 2020
Optimal Pebbling Number of the Square Grid.
Graphs Comb., 2020
Clique coverings and claw-free graphs.
Eur. J. Comb., 2020
Edge colorings of graphs without monochromatic stars.
Discret. Math., 2020
Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2.
Comb. Probab. Comput., 2020
3-Uniform Hypergraphs without a Cycle of Length Five.
Electron. J. Comb., 2020
Cycle Traversability for Claw-Free Graphs and Polyhedral Maps.
Comb., 2020
2019
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs.
Theor. Comput. Sci., 2019
A note on the maximum number of triangles in a C5-free graph.
J. Graph Theory, 2019
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs.
J. Comb. Theory, Ser. A, 2019
The maximum number of P<sub>ℓ</sub> copies in P<sub>k</sub>-free graphs.
Discret. Math. Theor. Comput. Sci., 2019
The optimal pebbling number of staircase graphs.
Discret. Math., 2019
Mobile versus Point Guards.
Discret. Comput. Geom., 2019
Optimal pebbling and rubbling of graphs with given diameter.
Discret. Appl. Math., 2019
Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle.
Comb. Probab. Comput., 2019
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing.
CoRR, 2019
On the Rainbow Turán number of paths.
Electron. J. Comb., 2019
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.
Discret. Math., 2018
Terminal-pairability in complete bipartite graphs.
Discret. Appl. Math., 2018
A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy.
Electron. J. Comb., 2018
2017
On the number of edge-disjoint triangles in K<sub>4</sub>-free graphs.
Electron. Notes Discret. Math., 2017
A note on the maximum number of triangles in a C<sub>5</sub>-free graph.
Electron. Notes Discret. Math., 2017
3-uniform hypergraphs and linear cycles.
Electron. Notes Discret. Math., 2017
Constructions for the Optimal Pebbling of Grids.
Period. Polytech. Electr. Eng. Comput. Sci., 2017
Note on terminal-pairability in complete grid graphs.
Discret. Math., 2017
On the Number of Edge-Disjoint Triangles in K 4-Free Graphs.
Comb., 2017
2016
A list version of graph packing.
Discret. Math., 2016
Making a C<sub>6</sub>-free graph C<sub>4</sub>-free and bipartite.
Discret. Appl. Math., 2016
Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem.
Comput. Geom., 2016
2015
Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem.
CoRR, 2015
Optimal pebbling of grids.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
2012
Efficient algorithms for the periodic subgraphs mining problem.
J. Discrete Algorithms, 2012
Hypergraphs with no cycle of length 4.
Discret. Math., 2012
Hypergraphs with No Cycle of a Given Length.
Comb. Probab. Comput., 2012
The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs.
Comb. Probab. Comput., 2012
3-uniform hypergraphs avoiding a given odd cycle.
Comb., 2012
2011
Electron. Notes Discret. Math., 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.
Electron. Notes Discret. Math., 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 K<sub>1, 4</sub>-free graphs.
Discret. Math., 2010
2009
Hypergraphs with no odd cycle of given length.
Electron. Notes Discret. Math., 2009
A new type of edge-derived vertex coloring.
Discret. Math., 2009
2008
General neighbour-distinguishing index of a graph.
Discret. Math., 2008
Connected graphs without long paths.
Discret. Math., 2008
2007
Adjacent Vertex Distinguishing Edge-Colorings.
SIAM J. Discret. Math., 2007
2006
Triangle-Free Hypergraphs.
Comb. Probab. Comput., 2006
2005
An extremal problem concerning graphs not containing <i>K</i><sub><i>t</i></sub> and <i>K</i><sub><i>t</i>, <i>t</i>, <i>t</i></sub>.
Discret. Math., 2005
2004
Longest Paths in Circular Arc Graphs.
Comb. Probab. Comput., 2004
2003
2002
Two-edge colorings of graphs with bounded degree in both colors.
Discret. Math., 2002
2001
On the Strong Product of a k-Extendable and an l-Extendable Graph.
Graphs Comb., 2001
2000
Vertex-Disjoint Cycles Containing Specified Edges.
Graphs Comb., 2000
1999
How to make a graph four-connected.
Math. Program., 1999
1997
Graphs without short odd cycles are nearly bipartite.
Discret. Math., 1997
C<sub>6</sub>-free bipartite graphs and product representation of squares.
Discret. Math., 1997
1996
Generalized Guarding and Partitioning for Rectilinear Polygons.
Comput. Geom., 1996
1992
The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable.
Discret. Math., 1992
1991
An Extremal Problem on Sparse 0-1 Matrices.
SIAM J. Discret. Math., 1991
On the maximal number of certain subgraphs in<i>K</i><sub><i>r</i></sub>-free graphs.
Graphs Comb., 1991
On the number of edge disjoint cliques in graphs of given size.
Comb., 1991
1989
On the number of C<sub>5</sub>'s in a triangle-free graph.
Comb., 1989
1988
Average distance in graphs with removed elements.
J. 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.
Comb., 1985
1984
A minimax theorem on intervals.
J. Comb. Theory, Ser. B, 1984
1981
An n-dimensional search problem with restricted questions.
Comb., 1981
Partition conditions and vertex-connectivity of graphs.
Comb., 1981
1978
A theorem of the transversal theory for matroids of finite character.
Discret. Math., 1978
On the structures induced by bipartite graphs and infinite matroids.
Discret. Math., 1978
