André E. Kézdy

Publication Activity (10 Years)

Years Active: 1991-2023
Publications (10 Years): 14

Top Topics

Top Venues

Discret. Appl. Math.

Inf. Process. Lett.

Electron. J. Comb.

Publications

André E. Kézdy, Jeno Lehel
An asymptotic resolution of a conjecture of Szemerédi and Petruska. Discret. Math. 346 (8) (2023)
André E. Kézdy, Jeno Lehel
An asymptotic resolution of a conjecture of Szemerédi and Petruska. CoRR (2022)
Adam S. Jobson, André E. Kézdy, Kevin G. Milans, Douglas B. West, D. Jacob Wildstrom
Systems of Overlap Representation for Families of Intervals. Graphs Comb. 38 (2) (2022)
Adam S. Jobson, André E. Kézdy, Jeno Lehel
Eckhoff's Problem on Convex Sets in the Plane. Electron. J. Comb. 28 (3) (2021)
Adam S. Jobson, André E. Kézdy, Jeno Lehel
Path-pairability of infinite planar grids. Period. Math. Hung. 83 (2) (2021)
Adam S. Jobson, André E. Kézdy
All Minor-Minimal Apex Obstructions with Connectivity Two. Electron. J. Comb. 28 (1) (2021)
Adam S. Jobson, André E. Kézdy, Jeno Lehel
Minimal 2-connected graphs satisfying the even cut condition. Inf. Process. Lett. 167 (2021)
Adam S. Jobson, André E. Kézdy, Jeno Lehel
Note on the bisection width of cubic graphs. Discret. Appl. Math. 285 (2020)
Adam S. Jobson, André E. Kézdy, Jeno Lehel, Timothy J. Pervenecki, Géza Tóth
Petruska's question on planar convex sets. Discret. Math. 343 (9) (2020)
Adam S. Jobson, André E. Kézdy, Jeno Lehel, Gábor Mészáros
The path-pairability number of products of stars. Discuss. Math. Graph Theory 39 (4) (2019)
Adam S. Jobson, André E. Kézdy
All minor-minimal apex obstructions with connectivity two. CoRR (2018)
Adam S. Jobson, André E. Kézdy, Jeno Lehel
Linkage on the infinite grid. Inf. Process. Lett. 137 (2018)
Adam S. Jobson, André E. Kézdy, Jeno Lehel
The minimum size of graphs satisfying cut conditions. Discret. Appl. Math. 237 (2018)
Adam S. Jobson, André E. Kézdy, Jenö Lehel, Susan C. White
Detour trees. Discret. Appl. Math. 206 (2016)
Timothy M. Brauch, André E. Kézdy, Hunter S. Snevily
The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite Graphs. Ars Comb. 114 (2014)
Adam S. Jobson, André E. Kézdy, Susan C. White
Connected matchings in chordal bipartite graphs. Discret. Optim. 14 (2014)
André E. Kézdy, Hunter S. Snevily, Susan C. White
. Electron. J. Comb. 16 (1) (2009)
Maria Axenovich, André E. Kézdy, Ryan R. Martin
On the editing distance of graphs. J. Graph Theory 58 (2) (2008)
André E. Kézdy
rho-Valuations for some stunted trees. Discret. Math. 306 (21) (2006)
András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Odd cycles and Theta-cycles in hypergraphs. Discret. Math. 306 (19-20) (2006)
André E. Kézdy, Hunter S. Snevily
Polynomials that Vanish on Distinct nth Roots of Unity. Comb. Probab. Comput. 13 (1) (2004)
André E. Kézdy, Jenö Lehel, Robert C. Powers
Heavy Transversals and Indecomposable Hypergraphs. Comb. 23 (2) (2003)
András Gyárfás, André E. Kézdy, Jenö Lehel
A finite basis characterization of ?-split colorings. Discret. Math. 257 (2-3) (2002)
André E. Kézdy, Hunter S. Snevily
Distinct Sums Modulo N And Tree Embeddings. Comb. Probab. Comput. 11 (1) (2002)
André E. Kézdy, Matthew Scobee
A proof of Hougardy's conjecture for diamond-free graphs. Discret. Math. 240 (1-3) (2001)
Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang
Clique covering the edges of a locally cobipartite graph. Discret. Math. 219 (1-3) (2000)
André E. Kézdy, Chi Wang
Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling. Discret. Math. 194 (1-3) (1999)
Michael S. Jacobson, André E. Kézdy, Jeno Lehel
Scenic graphs II: non-traceable graphs. Australas. J Comb. 19 (1999)
Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Scenic Graphs I: Traceable Graphs. Ars Comb. 49 (1998)
Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Tough enough chordal graphs are Hamiltonian. Networks 31 (1) (1998)
Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete. Networks 31 (1) (1998)
André E. Kézdy, Hunter S. Snevily
On Extensions of a Conjecture of Gallai. J. Comb. Theory, Ser. B 70 (2) (1997)
Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Recognizing Intersection Graphs of Linear Uniform Hypergraphs. Graphs Comb. 13 (4) (1997)
André E. Kézdy, Hunter S. Snevily, Chi Wang
Partitioning Permutations into Increasing and Decreasing Subsequences. J. Comb. Theory, Ser. A 73 (2) (1996)
Michael S. Jacobson, André E. Kézdy, Douglas B. West
The 2-intersection number of paths and bounded-degree trees. J. Graph Theory 19 (4) (1995)
André E. Kézdy, Patrick McGuinness
Minor. SODA (1992)
André E. Kézdy, Patrick McGuinness
? J. Graph Theory 15 (4) (1991)