Kézdy, André E.; Lehel, Jenő An asymptotic resolution of a conjecture of Szemerédi and Petruska. (English) Zbl 07690028 Discrete Math. 346, No. 8, Article ID 113469, 15 p. (2023). MSC: 05C65 05D05 05D15 PDF BibTeX XML Cite \textit{A. E. Kézdy} and \textit{J. Lehel}, Discrete Math. 346, No. 8, Article ID 113469, 15 p. (2023; Zbl 07690028) Full Text: DOI arXiv OpenURL
Jobson, Adam S.; Kézdy, André E.; Milans, Kevin G.; West, Douglas B.; Wildstrom, D. Jacob Systems of overlap representation for families of intervals. (English) Zbl 1496.05184 Graphs Comb. 38, No. 2, Paper No. 36, 6 p. (2022). Reviewer: Peter Borg (Malta) MSC: 05D05 05D15 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Graphs Comb. 38, No. 2, Paper No. 36, 6 p. (2022; Zbl 1496.05184) Full Text: DOI OpenURL
Ebanks, Bruce; Kézdy, André E. Reduction formulas for higher order derivations and a hypergeometric identity. (English) Zbl 1475.39001 Aequationes Math. 95, No. 6, 1053-1065 (2021). MSC: 39B52 13N15 05A10 33C05 33C20 39B72 PDF BibTeX XML Cite \textit{B. Ebanks} and \textit{A. E. Kézdy}, Aequationes Math. 95, No. 6, 1053--1065 (2021; Zbl 1475.39001) Full Text: DOI OpenURL
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő Path-pairability of infinite planar grids. (English) Zbl 1499.05168 Period. Math. Hung. 83, No. 2, 220-232 (2021). MSC: 05C10 05C38 05C40 05C63 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Period. Math. Hung. 83, No. 2, 220--232 (2021; Zbl 1499.05168) Full Text: DOI OpenURL
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő The Szemerédi-Petruska conjecture for a few small values. (English) Zbl 1479.05240 Eur. J. Math. 7, No. 4, 1791-1798 (2021). MSC: 05C65 05D05 05D15 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Eur. J. Math. 7, No. 4, 1791--1798 (2021; Zbl 1479.05240) Full Text: DOI arXiv OpenURL
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő Eckhoff’s problem on convex sets in the plane. (English) Zbl 1471.52001 Electron. J. Comb. 28, No. 3, Research Paper P3.43, 7 p. (2021). MSC: 52A10 52A35 05C62 05D05 05D15 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Electron. J. Comb. 28, No. 3, Research Paper P3.43, 7 p. (2021; Zbl 1471.52001) Full Text: DOI OpenURL
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő Minimal 2-connected graphs satisfying the even cut condition. (English) Zbl 07319589 Inf. Process. Lett. 167, Article ID 106080, 7 p. (2021). MSC: 05C40 05C82 05C35 05C70 68R10 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Inf. Process. Lett. 167, Article ID 106080, 7 p. (2021; Zbl 07319589) Full Text: DOI OpenURL
Jobson, Adam S.; Kézdy, André E. All minor-minimal apex obstructions with connectivity two. (English) Zbl 1456.05040 Electron. J. Comb. 28, No. 1, Research Paper P1.23, 58 p. (2021). MSC: 05C10 05C83 PDF BibTeX XML Cite \textit{A. S. Jobson} and \textit{A. E. Kézdy}, Electron. J. Comb. 28, No. 1, Research Paper P1.23, 58 p. (2021; Zbl 1456.05040) Full Text: DOI arXiv OpenURL
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő Note on the bisection width of cubic graphs. (English) Zbl 1447.05109 Discrete Appl. Math. 285, 434-442 (2020). MSC: 05C30 05C82 68R10 68M10 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Discrete Appl. Math. 285, 434--442 (2020; Zbl 1447.05109) Full Text: DOI OpenURL
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő; Pervenecki, Timothy J.; Tóth, Géza Petruska’s question on planar convex sets. (English) Zbl 1443.05133 Discrete Math. 343, No. 9, Article ID 111956, 12 p. (2020). MSC: 05C65 05C62 05C35 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Discrete Math. 343, No. 9, Article ID 111956, 12 p. (2020; Zbl 1443.05133) Full Text: DOI arXiv OpenURL
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő On path-pairability of the finite grids. (English) Zbl 1425.05037 Eur. J. Math. 5, No. 4, 1352-1363 (2019). MSC: 05C10 05C38 05C40 94C15 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Eur. J. Math. 5, No. 4, 1352--1363 (2019; Zbl 1425.05037) Full Text: DOI OpenURL
Jobson, Adam S.; Kézdy, André.; Lehel, Jenő; Mészáros, Gábor The path-pairability number of product of stars. (English) Zbl 1415.05094 Discuss. Math., Graph Theory 39, No. 4, 909-924 (2019). MSC: 05C38 05C40 05C76 05C82 05C90 90B18 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Discuss. Math., Graph Theory 39, No. 4, 909--924 (2019; Zbl 1415.05094) Full Text: DOI OpenURL
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő Linkage on the infinite grid. (English) Zbl 1478.68246 Inf. Process. Lett. 137, 51-56 (2018). MSC: 68R10 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Inf. Process. Lett. 137, 51--56 (2018; Zbl 1478.68246) Full Text: DOI OpenURL
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő The minimum size of graphs satisfying cut conditions. (English) Zbl 1380.05047 Discrete Appl. Math. 237, 89-96 (2018). MSC: 05C12 05C35 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Discrete Appl. Math. 237, 89--96 (2018; Zbl 1380.05047) Full Text: DOI OpenURL
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő; White, Susan C. Detour trees. (English) Zbl 1335.05099 Discrete Appl. Math. 206, 73-80 (2016). MSC: 05C38 05C05 05C12 05C35 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Discrete Appl. Math. 206, 73--80 (2016; Zbl 1335.05099) Full Text: DOI OpenURL
Ahmed, Tanbir; Kézdy, André; West, Douglas B. Remembering Hunter Snevily. (English) Zbl 1326.01049 Bull. Inst. Comb. Appl. 73, 7-17 (2015). MSC: 01A70 PDF BibTeX XML Cite \textit{T. Ahmed} et al., Bull. Inst. Comb. Appl. 73, 7--17 (2015; Zbl 1326.01049) OpenURL
Brauch, Timothy M.; Kézdy, André E.; Snevily, Hunter S. The combinatorial Nullstellensatz and DFT on perfect matchings in bipartite graphs. (English) Zbl 1324.65162 Ars Comb. 114, 461-475 (2014). MSC: 65T50 05C70 PDF BibTeX XML Cite \textit{T. M. Brauch} et al., Ars Comb. 114, 461--475 (2014; Zbl 1324.65162) OpenURL
Jobson, Adam S.; Kézdy, André E.; White, Susan C. Connected matchings in chordal bipartite graphs. (English) Zbl 1308.90149 Discrete Optim. 14, 34-45 (2014). MSC: 90C27 05C70 05C83 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., Discrete Optim. 14, 34--45 (2014; Zbl 1308.90149) Full Text: DOI OpenURL
Kézdy, André E.; Wiglesworth, Lesley W. Unit stack visibility graphs. (English) Zbl 1293.05236 J. Comb. Math. Comb. Comput. 88, 95-110 (2014). MSC: 05C62 68U05 PDF BibTeX XML Cite \textit{A. E. Kézdy} and \textit{L. W. Wiglesworth}, J. Comb. Math. Comb. Comput. 88, 95--110 (2014; Zbl 1293.05236) OpenURL
Jobson, Adam S.; Kézdy, André E.; Snevily, Hunter S.; White, Susan C. Ramsey functions for quasi-progressions with large diameter. (English) Zbl 1269.05110 J. Comb. 2, No. 4, 557-573 (2011). MSC: 05D10 11B25 PDF BibTeX XML Cite \textit{A. S. Jobson} et al., J. Comb. 2, No. 4, 557--573 (2011; Zbl 1269.05110) Full Text: DOI OpenURL
Kézdy, André E.; Snevily, Hunter S.; White, Susan C. Generalized Schur numbers for \(x_1+ x_2+ c= 3x_3\). (English) Zbl 1186.05117 Electron. J. Comb. 16, No. 1, Research Paper R105, 13 p. (2009). MSC: 05D10 PDF BibTeX XML Cite \textit{A. E. Kézdy} et al., Electron. J. Comb. 16, No. 1, Research Paper R105, 13 p. (2009; Zbl 1186.05117) Full Text: EMIS OpenURL
Axenovich, Maria; Kézdy, André; Martin, Ryan On the editing distance of graphs. (English) Zbl 1156.05027 J. Graph Theory 58, No. 2, 123-138 (2008). Reviewer: Frank Plastria (Brussels) MSC: 05C35 05C12 05C80 PDF BibTeX XML Cite \textit{M. Axenovich} et al., J. Graph Theory 58, No. 2, 123--138 (2008; Zbl 1156.05027) Full Text: DOI arXiv OpenURL
Kézdy, André E. \(\rho\)-valuations for some stunted trees. (English) Zbl 1103.05072 Discrete Math. 306, No. 21, 2786-2789 (2006). Reviewer: Masakazu Teragaito (Hiroshima) MSC: 05C78 05C05 05C70 PDF BibTeX XML Cite \textit{A. E. Kézdy}, Discrete Math. 306, No. 21, 2786--2789 (2006; Zbl 1103.05072) Full Text: DOI OpenURL
Gyárfás, András; Jacobson, Michael S.; Kézdy, André E.; Lehel, Jenő Odd cycles and \(\Theta\)-cycles in hypergraphs. (English) Zbl 1103.05056 Discrete Math. 306, No. 19-20, 2481-2491 (2006). Reviewer: Benjamin Doerr (Saarbrücken) MSC: 05C65 05C35 05C38 PDF BibTeX XML Cite \textit{A. Gyárfás} et al., Discrete Math. 306, No. 19--20, 2481--2491 (2006; Zbl 1103.05056) Full Text: DOI OpenURL
Kézdy, André; Snevily, Hunter S. Polynomials that vanish on distinct \(n\)th roots of unity. (English) Zbl 1078.05008 Comb. Probab. Comput. 13, No. 1, 37-59 (2004). Reviewer: Hans-Gert Gräbe (Leipzig) MSC: 05A99 30C10 13P10 13B25 11C08 05C70 05B15 05C45 PDF BibTeX XML Cite \textit{A. Kézdy} and \textit{H. S. Snevily}, Comb. Probab. Comput. 13, No. 1, 37--59 (2004; Zbl 1078.05008) Full Text: DOI OpenURL
Kézdy, A. E.; Lehel, J.; Powers, R. C. Heavy transversals and indecomposable hypergraphs. (English) Zbl 1047.05031 Combinatorica 23, No. 2, 303-310 (2003). Reviewer: Csaba Szabó (Budapest) MSC: 05C65 05C05 05C90 05D15 PDF BibTeX XML Cite \textit{A. E. Kézdy} et al., Combinatorica 23, No. 2, 303--310 (2003; Zbl 1047.05031) Full Text: DOI OpenURL
Gyárfás, András; Kézdy, André E.; Lehel, Jenő A finite basis characterization of alpha-split colorings. (English) Zbl 1008.05057 Discrete Math. 257, No. 2-3, 415-421 (2002). Reviewer: Gabriel Semanišin (Košice) MSC: 05C15 05C55 05C69 PDF BibTeX XML Cite \textit{A. Gyárfás} et al., Discrete Math. 257, No. 2--3, 415--421 (2002; Zbl 1008.05057) Full Text: DOI OpenURL
Kézdy, André E.; Snevily, Hunter S. Distinct sums modulo \(n\) and tree embeddings. (English) Zbl 0997.05029 Comb. Probab. Comput. 11, No. 1, 35-42 (2002). Reviewer: D.V.Chopra (Wichita) MSC: 05C10 05C05 05A05 05C70 PDF BibTeX XML Cite \textit{A. E. Kézdy} and \textit{H. S. Snevily}, Comb. Probab. Comput. 11, No. 1, 35--42 (2002; Zbl 0997.05029) Full Text: DOI OpenURL
Kézdy, André E.; Nielsen, Mark J.; Snevily, Hunter S. Generalized triangle inequalities in \(\mathbb{R}^n\). (English) Zbl 0995.52002 Bull. Inst. Comb. Appl. 33, 23-28 (2001). Reviewer: Horst Martini (Chemnitz) MSC: 52A40 51M16 PDF BibTeX XML Cite \textit{A. E. Kézdy} et al., Bull. Inst. Comb. Appl. 33, 23--28 (2001; Zbl 0995.52002) OpenURL
Kézdy, André E.; Scobee, Matthew A proof of Hougardy’s conjecture for diamond-free graphs. (English) Zbl 0989.05046 Discrete Math. 240, No. 1-3, 83-95 (2001). Reviewer: Saul Stahl (Lawrence) MSC: 05C17 05C75 PDF BibTeX XML Cite \textit{A. E. Kézdy} and \textit{M. Scobee}, Discrete Math. 240, No. 1--3, 83--95 (2001; Zbl 0989.05046) Full Text: DOI OpenURL
Chen, Guantao; Hall, Frank J.; Kezdy, Andre E.; Li, Zhongshan; Zhou, Huishan Isomorphisms involving reversing arcs of digraphs. (English) Zbl 0982.05055 J. Comb. Math. Comb. Comput. 36, 155-160 (2001). Reviewer: F.Gliviak (Bratislava) MSC: 05C20 05C60 05C75 PDF BibTeX XML Cite \textit{G. Chen} et al., J. Comb. Math. Comb. Comput. 36, 155--160 (2001; Zbl 0982.05055) OpenURL
Chen, Guantao; Jacobson, Michael S.; Kézdy, André E.; Lehel, Jenö; Scheinerman, Edward R.; Wang, Chi Clique covering the edges of a locally cobipartite graph. (English) Zbl 0949.05065 Discrete Math. 219, No. 1-3, 17-26 (2000). Reviewer: G.Gutin (Odense) MSC: 05C70 PDF BibTeX XML Cite \textit{G. Chen} et al., Discrete Math. 219, No. 1--3, 17--26 (2000; Zbl 0949.05065) Full Text: DOI OpenURL
Gyárfás, András; Jacobson, Michael S.; Kézdy, André E.; Lehel, Jenö Odd cycles and \(\Theta\)-cycles in hypergraphs. (English) Zbl 1109.05314 Sali, A. (ed.) et al., Paul Erdős and his mathematics. Papers from the international conference held in memory of Paul Erdős in Budapest, Hungary, July 4–11, 1999. Budapest: János Bolyai Mathematical Society (ISBN 963-8022-93-0). 96-98 (1999). MSC: 05C38 05C65 PDF BibTeX XML Cite \textit{A. Gyárfás} et al., in: Paul Erdős and his mathematics. Papers from the international conference held in memory of Paul Erdős in Budapest, Hungary, July 4--11, 1999. Budapest: János Bolyai Mathematical Society. 96--98 (1999; Zbl 1109.05314) OpenURL
Jacobson, Michael S.; Kézdy, André E.; Lehel, Jenő Scenic graphs. II: Non-traceable graphs. (English) Zbl 0929.05048 Australas. J. Comb. 19, 287-307 (1999). MSC: 05C38 05C45 PDF BibTeX XML Cite \textit{M. S. Jacobson} et al., Australas. J. Comb. 19, 287--307 (1999; Zbl 0929.05048) OpenURL
Kézdy, André E.; Wang, Chi Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling. (English) Zbl 0934.05056 Discrete Math. 194, No. 1-3, 261-265 (1999). Reviewer: Timothy R.Walsh (Montreal) MSC: 05C15 05C38 05C78 05C85 68R10 PDF BibTeX XML Cite \textit{A. E. Kézdy} and \textit{C. Wang}, Discrete Math. 194, No. 1--3, 261--265 (1999; Zbl 0934.05056) Full Text: DOI OpenURL
Jacobson, Michael S.; Kézdy, André E.; Lehel, Jenő Scenic graphs. I: Traceable graphs. (English) Zbl 0963.05086 Ars Comb. 49, 79-96 (1998). Reviewer: Martin Klazar (Praha) MSC: 05C45 05C38 PDF BibTeX XML Cite \textit{M. S. Jacobson} et al., Ars Comb. 49, 79--96 (1998; Zbl 0963.05086) OpenURL
Chen, Guantao; Jacobson, Michael S.; Kézdy, André E.; Lehel, Jenő Tough enough chordal graphs are Hamiltonian. (English) Zbl 0894.90150 Networks 31, No. 1, 29-38 (1998). MSC: 90C35 PDF BibTeX XML Cite \textit{G. Chen} et al., Networks 31, No. 1, 29--38 (1998; Zbl 0894.90150) Full Text: DOI OpenURL
Jacobson, Michael S.; Kézdy, André E.; Lehel, Jenő Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete. (English) Zbl 0894.90154 Networks 31, No. 1, 1-10 (1998). MSC: 90C35 90C60 PDF BibTeX XML Cite \textit{M. S. Jacobson} et al., Networks 31, No. 1, 1--10 (1998; Zbl 0894.90154) Full Text: DOI OpenURL
Jacobson, Michael S.; Kézdy, André E.; Lehel, Jenő Recognizing intersection graphs of linear uniform hypergraphs. (English) Zbl 0895.05046 Graphs Comb. 13, No. 4, 359-367 (1997). Reviewer: T.Ishihara (Tokushima) MSC: 05C65 05C75 05C85 PDF BibTeX XML Cite \textit{M. S. Jacobson} et al., Graphs Comb. 13, No. 4, 359--367 (1997; Zbl 0895.05046) Full Text: DOI OpenURL
Kézdy, A. E.; Kubicki, G. \(K_{12}\) is not a closed sphere-of-influence graph. (English) Zbl 0884.05089 Bárány, Imre (ed.) et al., Intuitive geometry. Proceedings of the 5th conference, Budapest, Hungary, September 3–8, 1995. Budapest: János Bolyai Mathematical Society. Bolyai Soc. Math. Stud. 6, 383-397 (1997). Reviewer: B.Mohar (Ljubljana) MSC: 05C99 PDF BibTeX XML Cite \textit{A. E. Kézdy} and \textit{G. Kubicki}, Bolyai Soc. Math. Stud. 6, 383--397 (1997; Zbl 0884.05089) OpenURL
Kézdy, André E.; Snevily, Hunter S. On extensions of a conjecture of Gallai. (English) Zbl 0880.05041 J. Comb. Theory, Ser. B 70, No. 2, 317-324 (1997). Reviewer: J.Fiamčik (Prešov) MSC: 05C15 PDF BibTeX XML Cite \textit{A. E. Kézdy} and \textit{H. S. Snevily}, J. Comb. Theory, Ser. B 70, No. 2, 317--324 (1997; Zbl 0880.05041) Full Text: DOI OpenURL
Kézdy, André E.; Snevily, Hunter S.; Wang, Chi Partitioning permutations into increasing and decreasing subsequences. (English) Zbl 0844.05003 J. Comb. Theory, Ser. A 73, No. 2, 353-359 (1996). Reviewer: L.Lesniak Foster (Madison) MSC: 05A05 05C15 05C99 05C55 PDF BibTeX XML Cite \textit{A. E. Kézdy} et al., J. Comb. Theory, Ser. A 73, No. 2, 353--359 (1996; Zbl 0844.05003) Full Text: DOI OpenURL
Jacobson, Michael S.; Kézdy, André E.; Lehel, Jenő Intersection graphs associated with uniform hypergraphs. (English) Zbl 0899.05041 Congr. Numerantium 116, 173-192 (1996). MSC: 05C65 05-02 PDF BibTeX XML Cite \textit{M. S. Jacobson} et al., Congr. Numerantium 116, 173--192 (1996; Zbl 0899.05041) OpenURL
Kézdy, André; Seif, Steve When is a poset isomorphic to the poset of connected induced subgraphs of a graph? (English) Zbl 0890.05073 Southwest J. Pure Appl. Math. 1, 42-50 (1996). MSC: 05C99 06A06 PDF BibTeX XML Cite \textit{A. Kézdy} and \textit{S. Seif}, Southwest J. Pure Appl. Math. 1, 42--50 (1996; Zbl 0890.05073) Full Text: EuDML EMIS OpenURL
Jacobson, Michael S.; Kézdy, André E.; Seif, Steve The poset on connected induced subgraphs of a graph need not be Sperner. (English) Zbl 0835.06002 Order 12, No. 3, 315-318 (1995). MSC: 06A06 05C99 PDF BibTeX XML Cite \textit{M. S. Jacobson} et al., Order 12, No. 3, 315--318 (1995; Zbl 0835.06002) Full Text: DOI OpenURL
Jacobson, Michael S.; Kézdy, André E.; West, Douglas B. The 2-intersection number of paths and bounded-degree trees. (English) Zbl 0829.05037 J. Graph Theory 19, No. 4, 461-469 (1995). Reviewer: A.J.Goodman (Rolla) MSC: 05C35 05C38 05C05 PDF BibTeX XML Cite \textit{M. S. Jacobson} et al., J. Graph Theory 19, No. 4, 461--469 (1995; Zbl 0829.05037) Full Text: DOI OpenURL
Jacobson, Michael S.; Kézdy, André E.; Kubicka, Ewa; Kubicki, Grzegorz; Lehel, Jenö; Wang, Chi; West, Douglas B. The path spectrum of a graph. (English) Zbl 0901.05059 Congr. Numerantium 112, 49-63 (1995). MSC: 05C38 PDF BibTeX XML Cite \textit{M. S. Jacobson} et al., Congr. Numerantium 112, 49--63 (1995; Zbl 0901.05059) OpenURL
Kézdy, André; McGuinness, Patrick Sequential and parallel algorithms to find a \(K_ 5\) minor. (English) Zbl 0822.05025 Frederickson, Greg (ed.), Proceedings of the third annual ACM-SIAM symposium on discrete algorithms, held January 27-29, 1992, in Orlando, FL, USA. Philadelphia, PA: SIAM. 345-356 (1992). Reviewer: H.Bodlaender (Utrecht) MSC: 05C10 68R10 68Q25 68W15 05C40 PDF BibTeX XML Cite \textit{A. Kézdy} and \textit{P. McGuinness}, in: Proceedings of the third annual ACM-SIAM symposium on discrete algorithms, SODA '92, held January 27--29, 1992, in Orlando, FL, USA. Philadelphia, PA: SIAM; New York, NY: ACM. 345--356 (1992; Zbl 0822.05025) OpenURL
Kézdy, André E.; McGuinness, Patrick J. Do \(3n-5\) edges force a subdivision of \(K_5\)? (English) Zbl 0747.05037 J. Graph Theory 15, No. 4, 389-406 (1991). Reviewer: Michael Hager (Leonberg) MSC: 05C10 05C40 PDF BibTeX XML Cite \textit{A. E. Kézdy} and \textit{P. J. McGuinness}, J. Graph Theory 15, No. 4, 389--406 (1991; Zbl 0747.05037) Full Text: DOI OpenURL
Kézdy, André; Markert, Matthew; West, Douglas B. Wide posets with fixed height and cutset number. (English) Zbl 0731.06004 Order 7, No. 2, 115-132 (1990). Reviewer: J.Niederle (Brno) MSC: 06A07 PDF BibTeX XML Cite \textit{A. Kézdy} et al., Order 7, No. 2, 115--132 (1990; Zbl 0731.06004) Full Text: DOI OpenURL