| Publication | Date of Publication | Type |
|---|
Two-count interval representation of a permutation
Order | 2025-12-30 | Paper |
The Schrijver system of the length polyhedron of an interval order
Discrete Applied Mathematics | 2025-11-04 | Paper |
The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform -critical hypergraphs
European Journal of Mathematics | 2023-08-02 | Paper |
An asymptotic resolution of a conjecture of Szemerédi and Petruska
Discrete Mathematics | 2023-05-31 | Paper |
Systems of overlap representation for families of intervals
Graphs and Combinatorics | 2022-03-15 | Paper |
Reduction formulas for higher order derivations and a hypergeometric identity
Aequationes Mathematicae | 2021-12-06 | Paper |
Path-pairability of infinite planar grids
Periodica Mathematica Hungarica | 2021-11-27 | Paper |
The Szemerédi-Petruska conjecture for a few small values
European Journal of Mathematics | 2021-11-24 | Paper |
Eckhoff's problem on convex sets in the plane
The Electronic Journal of Combinatorics | 2021-08-27 | Paper |
Minimal 2-connected graphs satisfying the even cut condition
Information Processing Letters | 2021-03-11 | Paper |
All minor-minimal apex obstructions with connectivity two
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
Note on the bisection width of cubic graphs
Discrete Applied Mathematics | 2020-08-31 | Paper |
Petruska's question on planar convex sets
Discrete Mathematics | 2020-07-08 | Paper |
On path-pairability of the finite grids
European Journal of Mathematics | 2019-11-27 | Paper |
The path-pairability number of product of stars
Discussiones Mathematicae Graph Theory | 2019-07-04 | Paper |
| On a conjecture of Szemer\'edi and Petruska | 2019-04-09 | Paper |
Linkage on the infinite grid
Information Processing Letters | 2018-06-15 | Paper |
The minimum size of graphs satisfying cut conditions
Discrete Applied Mathematics | 2018-02-22 | Paper |
| The $6\times 6$ grid is $4$-path-pairable | 2017-08-17 | Paper |
| Escaping from a quadrant of the $6\times 6$ grid by edge disjoint paths | 2017-08-17 | Paper |
| Escaping from the corner of a grid by edge disjoint paths | 2017-08-17 | Paper |
Detour trees
Discrete Applied Mathematics | 2016-05-02 | Paper |
| scientific article; zbMATH DE number 6493053 (Why is no real title available?) | 2015-10-09 | Paper |
| The combinatorial Nullstellensatz and DFT on perfect matchings in bipartite graphs. | 2015-04-13 | Paper |
Connected matchings in chordal bipartite graphs
Discrete Optimization | 2015-04-09 | Paper |
| Unit stack visibility graphs | 2014-04-25 | Paper |
Ramsey functions for quasi-progressions with large diameter
Journal of Combinatorics | 2013-07-30 | Paper |
Generalized Schur numbers for \(x_1+ x_2+ c= 3x_3\)
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
On the editing distance of graphs
Journal of Graph Theory | 2008-06-12 | Paper |
| scientific article; zbMATH DE number 5145373 (Why is no real title available?) | 2007-04-23 | Paper |
Odd cycles and \(\Theta\)-cycles in hypergraphs
Discrete Mathematics | 2006-10-30 | Paper |
\(\rho\)-valuations for some stunted trees
Discrete Mathematics | 2006-10-30 | Paper |
Polynomials that Vanish on Distinct n th Roots of Unity
Combinatorics, Probability and Computing | 2004-09-07 | Paper |
Heavy transversals and indecomposable hypergraphs
Combinatorica | 2004-09-07 | Paper |
A finite basis characterization of alpha-split colorings
Discrete Mathematics | 2002-12-02 | Paper |
A proof of Hougardy's conjecture for diamond-free graphs
Discrete Mathematics | 2002-07-22 | Paper |
Distinct Sums Modulo <i>n</i> and Tree Embeddings
Combinatorics, Probability and Computing | 2002-05-14 | Paper |
Isomorphisms involving reversing arcs of digraphs
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2002-04-08 | Paper |
Generalized triangle inequalities in \(\mathbb{R}^n\)
Bulletin of the Institute of Combinatorics and its Applications | 2002-03-11 | Paper |
Scenic graphs. I: Traceable graphs
Ars Combinatoria | 2001-06-10 | Paper |
Clique covering the edges of a locally cobipartite graph
Discrete Mathematics | 2000-06-21 | Paper |
Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling
Discrete Mathematics | 2000-04-10 | Paper |
| scientific article; zbMATH DE number 1334643 (Why is no real title available?) | 1999-11-03 | Paper |
Recognizing intersection graphs of linear uniform hypergraphs
Graphs and Combinatorics | 1998-09-06 | Paper |
| scientific article; zbMATH DE number 1156653 (Why is no real title available?) | 1998-08-10 | Paper |
| scientific article; zbMATH DE number 1161248 (Why is no real title available?) | 1998-06-08 | Paper |
| scientific article; zbMATH DE number 1139286 (Why is no real title available?) | 1998-04-13 | Paper |
| scientific article; zbMATH DE number 1139286 (Why is no real title available?) | 1998-04-13 | Paper |
| scientific article; zbMATH DE number 1054785 (Why is no real title available?) | 1998-04-01 | Paper |
| scientific article; zbMATH DE number 1124477 (Why is no real title available?) | 1998-03-05 | Paper |
| scientific article; zbMATH DE number 1124474 (Why is no real title available?) | 1998-03-05 | Paper |
On extensions of a conjecture of Gallai
Journal of Combinatorial Theory. Series B | 1997-08-12 | Paper |
Partitioning permutations into increasing and decreasing subsequences
Journal of Combinatorial Theory. Series A | 1996-02-26 | Paper |
The poset on connected induced subgraphs of a graph need not be Sperner
Order | 1995-12-20 | Paper |
The 2‐intersection number of paths and bounded‐degree trees
Journal of Graph Theory | 1995-08-16 | Paper |
| scientific article; zbMATH DE number 742981 (Why is no real title available?) | 1995-04-11 | Paper |
Do 3n − 5 edges force a subdivision ofK5?
Journal of Graph Theory | 1992-06-26 | Paper |
Wide posets with fixed height and cutset number
Order | 1990-01-01 | Paper |
