| Publication | Date of Publication | Type |
|---|
Linear three-uniform hypergraphs with no Berge path of given length
Journal of Combinatorial Theory. Series B | 2025-01-13 | Paper |
A note on universal graphs for spanning trees
Discrete Applied Mathematics | 2025-01-06 | Paper |
The maximum number of pentagons in a planar graph
Journal of Graph Theory | 2025-01-06 | Paper |
A new construction for the planar Turán number of cycles
Graphs and Combinatorics | 2024-12-09 | Paper |
The maximum number of cliques in graphs with bounded odd circumference
Annals of Combinatorics | 2024-11-27 | Paper |
Covering the edges of a graph with triangles
Discrete Mathematics | 2024-11-09 | Paper |
Generalized Turán problems for even cycles
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
The structure of hypergraphs without long Berge cycles
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
The planar Turán number of \(\{K_4, C_5\}\) and \(\{K_4, C_6\}\)
Graphs and Combinatorics | 2024-10-09 | Paper |
Maximum cliques in a graph without disjoint given subgraph
Discrete Mathematics | 2024-02-19 | Paper |
Extremal results for graphs avoiding a rainbow subgraph
The Electronic Journal of Combinatorics | 2024-02-19 | Paper |
On \(3\)-uniform hypergraphs avoiding a cycle of length four
The Electronic Journal of Combinatorics | 2024-02-16 | Paper |
Book free 3-uniform hypergraphs
Discrete Mathematics | 2024-01-17 | Paper |
| On graphs without cycles of length 0 modulo 4 | 2023-12-15 | Paper |
The minimum number of 4-cycles in a maximal planar graph with small number of vertices
Bulletin of the Iranian Mathematical Society | 2023-11-23 | Paper |
| A note on universal graphs for spanning trees | 2023-11-02 | Paper |
Generalized Turán numbers for the edge blow-up of a graph
Discrete Mathematics | 2023-10-30 | Paper |
Edges Not Covered by Monochromatic Bipartite Graph
SIAM Journal on Discrete Mathematics | 2023-10-26 | Paper |
| Extending partial edge colorings | 2023-10-15 | Paper |
The maximum number of paths of length three in a planar graph
Journal of Graph Theory | 2023-10-05 | Paper |
The maximum number of induced C5's in a planar graph
Journal of Graph Theory | 2023-10-05 | Paper |
The maximum number of triangles in \(F_k\)-free graphs
European Journal of Combinatorics | 2023-10-02 | Paper |
| Outerplanar Tur\'an number of a cycle | 2023-09-30 | Paper |
Stability version of Dirac's theorem and its applications for generalized Turán problems
Bulletin of the London Mathematical Society | 2023-09-15 | Paper |
Stability version of Dirac's theorem and its applications for generalized Turán problems
Bulletin of the London Mathematical Society | 2023-09-15 | Paper |
| The planar Tur\'an number of $\{K_4,C_5\}$ and $\{K_4,C_6\}$ | 2023-08-17 | Paper |
| The planar Tur\'an number of the seven-cycle | 2023-07-13 | Paper |
| On the Small Quasi-kernel conjecture | 2023-07-09 | Paper |
Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs
The Electronic Journal of Combinatorics | 2023-06-15 | Paper |
Extremal problems of double stars
Discrete Mathematics & Theoretical Computer Science | 2023-05-31 | Paper |
Subgraph densities in \(K_r\)-free graphs
The Electronic Journal of Combinatorics | 2023-04-19 | Paper |
| A new construction for planar Tur\'an number of cycle | 2023-04-11 | Paper |
Turán numbers of Berge trees
Discrete Mathematics | 2023-02-21 | Paper |
| The maximum Wiener index of a uniform hypergraph | 2023-02-16 | Paper |
| On the rainbow planar Tur\'an number of paths | 2023-01-24 | Paper |
| The maximum number of cliques in graphs with bounded odd circumference | 2022-12-04 | Paper |
| Linear three-uniform hypergraphs with no Berge path of given length | 2022-11-29 | Paper |
Generalized outerplanar Turán number of short paths
Discrete Mathematics | 2022-11-02 | Paper |
Planar Turán number of the 6-cycle
SIAM Journal on Discrete Mathematics | 2022-08-31 | Paper |
| Extremal planar graphs with no cycles of particular lengths | 2022-08-29 | Paper |
| Exact results for generalized extremal problems forbidding an even cycle | 2022-08-04 | Paper |
On \(L(2,1)\)-labelings of some products of oriented cycles
Mathematical Foundations of Computing | 2022-06-01 | Paper |
| The maximum number of copies of an even cycle in a planar graph | 2022-05-31 | Paper |
The Turán number of the triangular pyramid of 3-layers
Discrete Applied Mathematics | 2022-05-27 | Paper |
Subgraph densities in $K_r$-free graphs
(available as arXiv preprint) | 2022-05-26 | Paper |
The exact linear Turán number of the sail
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
Inverse Turán numbers
Discrete Mathematics | 2022-03-14 | Paper |
On \(L(2 , 1)\)-labelings of oriented graphs
Discussiones Mathematicae Graph Theory | 2022-01-03 | Paper |
On the maximal colorings of complete graphs without some small properly colored subgraphs
Graphs and Combinatorics | 2021-11-30 | Paper |
Generalized planar Turán numbers
The Electronic Journal of Combinatorics | 2021-11-22 | Paper |
| Planar Tur\'an Number of Double Stars | 2021-10-20 | Paper |
The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
Discrete Mathematics | 2021-09-06 | Paper |
Half-graphs, other non-stable degree sequences, and the switch Markov chain
The Electronic Journal of Combinatorics | 2021-07-06 | Paper |
Connected hypergraphs without long Berge-paths
European Journal of Combinatorics | 2021-06-18 | Paper |
Avoiding long Berge cycles: the missing cases \(k=r+1\) and \(k=r+2\)
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Optimal pebbling and rubbling of graphs with given diameter
Discrete Applied Mathematics | 2021-05-19 | Paper |
Optimal pebbling and rubbling of graphs with given diameter
Discrete Applied Mathematics | 2021-05-19 | Paper |
The maximum Wiener index of maximal planar graphs
Journal of Combinatorial Optimization | 2021-05-10 | Paper |
The maximum number of paths of length four in a planar graph
Discrete Mathematics | 2021-03-25 | Paper |
On the anti-Ramsey number of forests
Discrete Applied Mathematics | 2021-03-25 | Paper |
The structure of hypergraphs without long Berge cycles
Journal of Combinatorial Theory. Series B | 2021-03-08 | Paper |
The structure of hypergraphs without long Berge cycles
Journal of Combinatorial Theory. Series B | 2021-03-08 | Paper |
Wiener index of quadrangulation graphs
Discrete Applied Mathematics | 2020-12-29 | Paper |
Cycle traversability for claw-free graphs and polyhedral maps
Combinatorica | 2020-12-18 | Paper |
| Set-Sequential Labelings of Odd Trees | 2020-11-25 | Paper |
Edge colorings of graphs without monochromatic stars
Discrete Mathematics | 2020-10-08 | Paper |
Generalized Turán problems for even cycles
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
Generalized Turán problems for even cycles
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
Clique coverings and claw-free graphs
European Journal of Combinatorics | 2020-06-16 | Paper |
| Planar Tur\'an Number of the $\Theta_6$ | 2020-06-01 | Paper |
3-uniform hypergraphs without a cycle of length five
The Electronic Journal of Combinatorics | 2020-05-20 | Paper |
Optimal pebbling number of the square grid
Graphs and Combinatorics | 2020-04-30 | Paper |
Turán number of an induced complete bipartite graph plus an odd cycle
Combinatorics, Probability and Computing | 2020-03-11 | Paper |
| Minimal colorings for properly colored subgraphs in complete graphs | 2019-11-11 | Paper |
| The Maximum Number of Pentagons in a Planar Graph | 2019-09-30 | Paper |
The maximum number of $P_\ell$ copies in $P_k$-free graphs
(available as arXiv preprint) | 2019-08-01 | Paper |
| The maximum number of $P_\ell$ copies in $P_k$-free graphs | 2019-08-01 | Paper |
The optimal pebbling number of staircase graphs
Discrete Mathematics | 2019-06-18 | Paper |
The optimal pebbling number of staircase graphs
Discrete Mathematics | 2019-06-18 | Paper |
Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
Theoretical Computer Science | 2019-05-29 | Paper |
Tur\'an numbers of Berge trees
(available as arXiv preprint) | 2019-04-14 | Paper |
A note on the maximum number of triangles in a C5‐free graph
Journal of Graph Theory | 2019-03-28 | Paper |
Terminal-pairability in complete graphs
(available as arXiv preprint) | 2019-03-11 | Paper |
On the rainbow Turán number of paths
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
On the rainbow Turán number of paths
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
Mobile versus point guards
Discrete & Computational Geometry | 2019-01-29 | Paper |
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
Journal of Combinatorial Theory. Series A | 2019-01-25 | Paper |
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
Journal of Combinatorial Theory. Series A | 2019-01-25 | Paper |
On the Turán number of some ordered even cycles
European Journal of Combinatorics | 2018-08-24 | Paper |
On the Turán number of some ordered even cycles
European Journal of Combinatorics | 2018-08-24 | Paper |
On the maximum size of connected hypergraphs without a path of given length
Discrete Mathematics | 2018-07-26 | Paper |
On the maximum size of connected hypergraphs without a path of given length
Discrete Mathematics | 2018-07-26 | Paper |
A note on the linear cycle cover conjecture of Gyárfás and Sárközy
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
A note on the linear cycle cover conjecture of Gyárfás and Sárközy
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
3-uniform hypergraphs and linear cycles
SIAM Journal on Discrete Mathematics | 2018-04-27 | Paper |
| 3-uniform hypergraphs and linear cycles | 2018-01-18 | Paper |
3-uniform hypergraphs and linear cycles
(available as arXiv preprint) | 2018-01-18 | Paper |
A note on the maximum number of triangles in a \(C_5\)-free graph
(available as arXiv preprint) | 2018-01-18 | Paper |
On the number of edge-disjoint triangles in \(K_4\)-free graphs
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Terminal-pairability in complete bipartite graphs
Discrete Applied Mathematics | 2018-01-11 | Paper |
Terminal-pairability in complete bipartite graphs
Discrete Applied Mathematics | 2018-01-11 | Paper |
An Erdős-Gallai type theorem for uniform hypergraphs
European Journal of Combinatorics | 2017-12-21 | Paper |
Note on terminal-pairability in complete grid graphs
Discrete Mathematics | 2017-02-27 | Paper |
Note on terminal-pairability in complete grid graphs
Discrete Mathematics | 2017-02-27 | Paper |
Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem
Computational Geometry | 2016-11-14 | Paper |
Hypergraph extensions of the Erdős-Gallai theorem
European Journal of Combinatorics | 2016-08-16 | Paper |
Making a \(C_6\)-free graph \(C_4\)-free and bipartite
Discrete Applied Mathematics | 2016-06-21 | Paper |
Toward Żak's conjecture on graph packing
Journal of Combinatorics | 2016-05-25 | Paper |
A list version of graph packing
Discrete Mathematics | 2016-05-18 | Paper |
On 3-uniform hypergraphs without linear cycles
Journal of Combinatorics | 2016-02-19 | Paper |
| Constructions for the optimal pebbling of grids | 2016-01-10 | Paper |
Hypergraphs with no odd cycle of given length
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Efficient algorithms for the periodic subgraphs mining problem
Journal of Discrete Algorithms | 2013-06-24 | Paper |
3-uniform hypergraphs avoiding a given odd cycle
Combinatorica | 2012-09-17 | Paper |
Richard Schelp (1936-2010)
Discrete Mathematics | 2012-07-04 | Paper |
Hypergraphs with no cycle of a given length
Combinatorics, Probability and Computing | 2012-05-14 | Paper |
The maximum number of triangles in \(C_{2k+1}\)-free graphs
Combinatorics, Probability and Computing | 2012-05-14 | Paper |
Hypergraph extensions of the Erdős-Gallai theorem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Hypergraphs with no cycle of length 4
Discrete Mathematics | 2012-04-30 | Paper |
Coloring vertices and edges of a graph by nonempty subsets of a set
European Journal of Combinatorics | 2011-04-08 | Paper |
Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs
Discrete Mathematics | 2010-10-18 | Paper |
A new type of edge-derived vertex coloring
Discrete Mathematics | 2009-12-15 | Paper |
On a problem of Erdős on integers, none of which divides the product of \(k\) others
European Journal of Combinatorics | 2009-12-01 | Paper |
Pentagons vs. triangles
Discrete Mathematics | 2008-09-04 | Paper |
Connected graphs without long paths
Discrete Mathematics | 2008-09-04 | Paper |
Adjacent Vertex Distinguishing Edge‐Colorings
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
General neighbour-distinguishing index of a graph
Discrete Mathematics | 2008-02-14 | Paper |
Triangle-Free Hypergraphs
Combinatorics, Probability and Computing | 2006-03-13 | Paper |
An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,t,t}\)
Discrete Mathematics | 2005-12-29 | Paper |
Longest Paths in Circular Arc Graphs
Combinatorics, Probability and Computing | 2004-09-24 | Paper |
Nearly bipartite graphs
Discrete Mathematics | 2003-11-25 | Paper |
A nine vertex theorem for 3-connected claw- free graphs
Studia Scientiarum Mathematicarum Hungarica | 2002-11-03 | Paper |
Two-edge colorings of graphs with bounded degree in both colors
Discrete Mathematics | 2002-05-28 | Paper |
On the strong product of a \(k\)-extendable and an \(l\)-extendable graph
Graphs and Combinatorics | 2001-09-09 | Paper |
Vertex-disjoint cycles containing specified edges
Graphs and Combinatorics | 2001-01-02 | Paper |
How to make a graph four-connected
Mathematical Programming. Series A. Series B | 2000-02-16 | Paper |
| scientific article; zbMATH DE number 1054780 (Why is no real title available?) | 1998-06-08 | Paper |
\(C_ 6\)-free bipartite graphs and product representation of squares
Discrete Mathematics | 1997-10-26 | Paper |
Graphs without short odd cycles are nearly bipartite
Discrete Mathematics | 1997-09-24 | Paper |
Generalized guarding and partitioning for rectilinear polygons
Computational Geometry | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 881161 (Why is no real title available?) | 1996-05-22 | Paper |
| scientific article; zbMATH DE number 736298 (Why is no real title available?) | 1995-08-06 | Paper |
| scientific article; zbMATH DE number 426334 (Why is no real title available?) | 1993-11-07 | Paper |
| scientific article; zbMATH DE number 426342 (Why is no real title available?) | 1993-11-01 | Paper |
The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
Discrete Mathematics | 1993-01-16 | Paper |
On the number of edge disjoint cliques in graphs of given size
Combinatorica | 1992-06-27 | Paper |
An Extremal Problem on Sparse 0-1 Matrices
SIAM Journal on Discrete Mathematics | 1992-06-25 | Paper |
On the maximal number of certain subgraphs in \(K_ r\)-free graphs
Graphs and Combinatorics | 1992-06-25 | Paper |
On the number of \(C_ 5's\) in a triangle-free graph
Combinatorica | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4123768 (Why is no real title available?) | 1988-01-01 | Paper |
Average distance in graphs with removed elements
Journal of Graph Theory | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4158653 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4196017 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4011939 (Why is no real title available?) | 1986-01-01 | Paper |
A Short Proof of the Rectilinear Art Gallery Theorem
SIAM Journal on Algebraic Discrete Methods | 1986-01-01 | Paper |
The number of small semispaces of a finite set of points in the plane
Journal of Combinatorial Theory. Series A | 1986-01-01 | Paper |
Any four independent edges of a 4-connected graph are contained in a circuit
Acta Mathematica Hungarica | 1985-01-01 | Paper |
Covering simply connected regions by rectangles
Combinatorica | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4031697 (Why is no real title available?) | 1984-01-01 | Paper |
A minimax theorem on intervals
Journal of Combinatorial Theory. Series B | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3827921 (Why is no real title available?) | 1983-01-01 | Paper |
On the edge numbers of graphs with Hadwiger number 4 and 5
Periodica Mathematica Hungarica | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3741451 (Why is no real title available?) | 1981-01-01 | Paper |
An \(n\)-dimensional search problem with restricted questions
Combinatorica | 1981-01-01 | Paper |
Partition conditions and vertex-connectivity of graphs
Combinatorica | 1981-01-01 | Paper |
On a problem of G. O. H. Katona and T. Tarján
Acta Mathematica Academiae Scientiarum Hungaricae | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3603293 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3732055 (Why is no real title available?) | 1978-01-01 | Paper |
A theorem of the transversal theory for matroids of finite character
Discrete Mathematics | 1978-01-01 | Paper |
On the structures induced by bipartite graphs and infinite matroids
Discrete Mathematics | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3609695 (Why is no real title available?) | 1977-01-01 | Paper |
The anti-Ramsey numbers of cliques in complete multi-partite graphs
(available as arXiv preprint) | N/A | Paper |
Jones' conjecture for Halin graphs and a bit more
(available as arXiv preprint) | N/A | Paper |
