Ervin Györi

,

Binlong Li

Discret. Math., 2026

The maximum number of pentagons in a planar graph.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, February, 2025

Exact Results for Generalized Extremal Problems Forbidding an Even Cycle.

[BibT_eX]

[DOI]

,

,

,

,

,

,

J. Graph Theory, 2025

Linear three-uniform hypergraphs with no Berge path of given length.

[BibT_eX]

[DOI]

,

Nika Salia

J. Comb. Theory B, 2025

On the rainbow planar Turán number of paths.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2025

Covering the edges of a graph with triangles.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2025

A note on universal graphs for spanning trees.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2025

A New Construction for the Planar Turán Number of Cycles.

[BibT_eX]

[DOI]

,

Kitti Varga

,

Xiutao Zhu

Graphs Comb., December, 2024

The Planar Turán Number of K4,C5 and K4,C6.

[BibT_eX]

[DOI]

,

Alan Li

,

Runtian Zhou

Graphs Comb., October, 2024

Maximum cliques in a graph without disjoint given subgraph.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., April, 2024

Book free 3-uniform hypergraphs.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., March, 2024

Generalized Turán numbers for the edge blow-up of a graph.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Discret. Math., January, 2024

The maximum number of copies of an even cycle in a planar graph.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Comb. Theory B, 2024

Set-sequential labelings of odd trees.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2024

Extremal Results for Graphs Avoiding a Rainbow Subgraph.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

Electron. J. Comb., 2024

Edges Not Covered by Monochromatic Bipartite Graph.

[BibT_eX]

[DOI]

,

,

,

,

,

,

SIAM J. Discret. Math., December, 2023

The maximum number of triangles in Fk-free graphs.

[BibT_eX]

[DOI]

,

,

,

,

Eur. J. Comb., December, 2023

Turán numbers of Berge trees.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., April, 2023

Generalized outerplanar Turán number of short paths.

[BibT_eX]

[DOI]

,

Addisu Paulos

,

Chuanqi Xiao

Discret. Math., 2023

On the Small Quasi-kernel conjecture.

[BibT_eX]

[DOI]

,

,

,

,

CoRR, 2023

Subgraph Densities in $K_r$-Free Graphs.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2023

Turán Numbers and Anti-Ramsey Numbers for Short Cycles in Complete $3$-Partite Graphs.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2023

On $3$-uniform hypergraphs avoiding a cycle of length four.

[BibT_eX]

[DOI]

,

,

,

,

Electron. J. Comb., 2023

Planar Turán Number of the 6-Cycle.

[BibT_eX]

[DOI]

,

,

,

,

SIAM J. Discret. Math., September, 2022

On L(2, 1)-labelings of some products of oriented cycles.

[BibT_eX]

[DOI]

Lucas Colucci

,

Math. Found. Comput., 2022

The maximum number of paths of length three in a planar graph.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Graph Theory, 2022

The maximum number of induced C 5 's in a planar graph.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Graph Theory, 2022

On L(2, 1)-labelings of oriented graphs.

[BibT_eX]

[DOI]

Lucas Colucci

,

Discuss. Math. Graph Theory, 2022

Inverse Turán numbers.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2022

The Turán number of the triangular pyramid of 3-layers.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2022

The structure of hypergraphs without long Berge cycles.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2021

On the Maximal Colorings of Complete Graphs Without Some Small Properly Colored Subgraphs.

[BibT_eX]

[DOI]

Chunqiu Fang

,

,

Jimeng Xiao

Graphs Comb., 2021

Connected hypergraphs without long Berge-paths.

[BibT_eX]

[DOI]

,

Nika Salia

,

Oscar Zamora

Eur. J. Comb., 2021

The maximum number of paths of length four in a planar graph.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Discret. Math., 2021

The anti-Ramsey numbers of C3 and C4 in complete r-partite graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2021

Wiener index of quadrangulation graphs.

[BibT_eX]

[DOI]

,

Addisu Paulos

,

Chuanqi Xiao

Discret. Appl. Math., 2021

On the anti-Ramsey number of forests.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2021

Generalized Planar Turán Numbers.

[BibT_eX]

[DOI]

,

,

,

,

Electron. J. Comb., 2021

The Exact Linear Turán Number of the Sail.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2021

Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain.

[BibT_eX]

[DOI]

,

,

,

,

Electron. J. Comb., 2021

Generalized Turán problems for even cycles.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2020

The maximum Wiener index of maximal planar graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Optim., 2020

Optimal Pebbling Number of the Square Grid.

[BibT_eX]

[DOI]

,

,

László F. Papp

Graphs Comb., 2020

Clique coverings and claw-free graphs.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2020

Edge colorings of graphs without monochromatic stars.

[BibT_eX]

[DOI]

Lucas Colucci

,

,

Discret. Math., 2020

Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2.

[BibT_eX]

[DOI]

,

,

,

,

,

Comb. Probab. Comput., 2020

3-Uniform Hypergraphs without a Cycle of Length Five.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2020

Cycle Traversability for Claw-Free Graphs and Polyhedral Maps.

[BibT_eX]

[DOI]

,

,

,

Comb., 2020

Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., 2019

A note on the maximum number of triangles in a C5-free graph.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2019

Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory A, 2019

The maximum number of Pℓ copies in Pk-free graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math. Theor. Comput. Sci., 2019

The optimal pebbling number of staircase graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2019

Mobile versus Point Guards.

[BibT_eX]

[DOI]

,

Discret. Comput. Geom., 2019

Optimal pebbling and rubbling of graphs with given diameter.

[BibT_eX]

[DOI]

,

,

László F. Papp

Discret. Appl. Math., 2019

Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle.

[BibT_eX]

[DOI]

,

,

Comb. Probab. Comput., 2019

A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing.

[BibT_eX]

[DOI]

,

,

,

,

CoRR, 2019

On the Rainbow Turán number of paths.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2019

On the Turán number of some ordered even cycles.

[BibT_eX]

[DOI]

,

,

,

,

,

Eur. J. Comb., 2018

An Erdős-Gallai type theorem for uniform hypergraphs.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2018

On the maximum size of connected hypergraphs without a path of given length.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2018

Terminal-pairability in complete bipartite graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2018

A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2018

On the number of edge-disjoint triangles in K4-free graphs.

[BibT_eX]

[DOI]

,

Balázs Keszegh

Electron. Notes Discret. Math., 2017

A note on the maximum number of triangles in a C5-free graph.

[BibT_eX]

[DOI]

,

,

,

Electron. Notes Discret. Math., 2017

3-uniform hypergraphs and linear cycles.

[BibT_eX]

[DOI]

,

,

Electron. Notes Discret. Math., 2017

Constructions for the Optimal Pebbling of Grids.

[BibT_eX]

[DOI]

,

,

László F. Papp

Period. Polytech. Electr. Eng. Comput. Sci., 2017

Note on terminal-pairability in complete grid graphs.

[BibT_eX]

[DOI]

,

,

Gábor Mészáros

Discret. Math., 2017

Mobile vs. point guards.

[BibT_eX]

[DOI]

,

CoRR, 2017

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

[BibT_eX]

[DOI]

,

Balázs Keszegh

Comb., 2017

A list version of graph packing.

[BibT_eX]

[DOI]

,

Alexandr V. Kostochka

,

Andrew McConvey

,

Derrek Yager

Discret. Math., 2016

Making a C6-free graph C4-free and bipartite.

[BibT_eX]

[DOI]

,

Scott Kensell

,

Casey Tompkins

Discret. Appl. Math., 2016

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

[BibT_eX]

[DOI]

,

Comput. Geom., 2016

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

[BibT_eX]

[DOI]

,

CoRR, 2015

Efficient algorithms for the periodic subgraphs mining problem.

[BibT_eX]

[DOI]

,

,

,

,

J. Discrete Algorithms, 2012

Hypergraphs with no cycle of length 4.

[BibT_eX]

[DOI]

,

Discret. Math., 2012

Hypergraphs with No Cycle of a Given Length.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2012

The Maximum Number of Triangles in C2k+1-Free Graphs.

[BibT_eX]

[DOI]

,

Hao Li

Comb. Probab. Comput., 2012

3-uniform hypergraphs avoiding a given odd cycle.

[BibT_eX]

[DOI]

,

Comb., 2012

Preface.

[BibT_eX]

[DOI]

Jarik Nesetril

,

,

Attila Sali

Electron. Notes Discret. Math., 2011

Coloring vertices and edges of a graph by nonempty subsets of a set.

[BibT_eX]

[DOI]

Paul N. Balister

,

,

Richard H. Schelp

Eur. J. Comb., 2011

Hypergraph Extensions of the Erdos-Gallai Theorem.

[BibT_eX]

[DOI]

,

,

Electron. Notes Discret. Math., 2010

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

[BibT_eX]

[DOI]

Tsz Ho Chan

,

,

András Sárközy

Eur. J. Comb., 2010

Cyclability in k-connected K1, 4-free graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2010

Hypergraphs with no odd cycle of given length.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 2009

A new type of edge-derived vertex coloring.

[BibT_eX]

[DOI]

,

Cory Palmer

Discret. Math., 2009

General neighbour-distinguishing index of a graph.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2008

Guest Editors' Foreword.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2008

Pentagons vs. triangles.

[BibT_eX]

[DOI]

Béla Bollobás

,

Discret. Math., 2008

Connected graphs without long paths.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2008

Adjacent Vertex Distinguishing Edge-Colorings.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2007

Triangle-Free Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

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

[BibT_eX]

[DOI]

,

Yoomi Rho

Discret. Math., 2005

Longest Paths in Circular Arc Graphs.

[BibT_eX]

[DOI]

,

,

,

Comb. Probab. Comput., 2004

Nearly bipartite graphs.

[BibT_eX]

[DOI]

,

Vladimir Nikiforov

,

Richard H. Schelp

Discret. Math., 2003

Two-edge colorings of graphs with bounded degree in both colors.

[BibT_eX]

[DOI]

,

Richard H. Schelp

Discret. Math., 2002

On the Strong Product of a k-Extendable and an l-Extendable Graph.

[BibT_eX]

[DOI]

,

Wilfried Imrich

Graphs Comb., 2001

Vertex-Disjoint Cycles Containing Specified Edges.

[BibT_eX]

[DOI]

,

,

,

,

,

Graphs Comb., 2000

How to make a graph four-connected.

[BibT_eX]

[DOI]

,

Tibor Jordán

Math. Program., 1999

Graphs without short odd cycles are nearly bipartite.

[BibT_eX]

[DOI]

,

Alexandr V. Kostochka

,

Tomasz Luczak

Discret. Math., 1997

C6-free bipartite graphs and product representation of squares.

[BibT_eX]

[DOI]

Discret. Math., 1997

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

[BibT_eX]

[DOI]

,

Michael D. Plummer

Discret. Math., 1992

An Extremal Problem on Sparse 0-1 Matrices.

[BibT_eX]

[DOI]

Daniel Bienstock

,

SIAM J. Discret. Math., 1991

On the maximal number of certain subgraphs inKr-free graphs.

[BibT_eX]

[DOI]

,

János Pach

,

Miklós Simonovits

Graphs Comb., 1991

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

[BibT_eX]

[DOI]

Comb., 1991

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

[BibT_eX]

[DOI]

Comb., 1989

Average distance in graphs with removed elements.

[BibT_eX]

[DOI]

Daniel Bienstock

,

J. Graph Theory, 1988

The number of small semispaces of a finite set of points in the plane.

[BibT_eX]

[DOI]

Noga Alon

,

J. Comb. Theory A, 1986

Covering simply connected regions by rectangles.

[BibT_eX]

[DOI]

Comb., 1985

A minimax theorem on intervals.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1984

An n-dimensional search problem with restricted questions.

[BibT_eX]

[DOI]

Comb., 1981

Partition conditions and vertex-connectivity of graphs.

[BibT_eX]

[DOI]

Comb., 1981

A theorem of the transversal theory for matroids of finite character.

[BibT_eX]

[DOI]

,

Eric C. Milner

Discret. Math., 1978

On the structures induced by bipartite graphs and infinite matroids.

[BibT_eX]

[DOI]