Skip to main content
SpringerLink
Log in

In memory of Svatopluk Poljak

  • Published:
Mathematical Programming Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. A note on stable sets and colouring of graphs,Comment. Math. Univ. Carolinae 15 (1974) 307–309.

    Google Scholar 

  2. (with M. Boguszak and J. Tuma) Note on homomorphism interpolation theorem,Comment. Math. Univ. Carolinae 17 (1976) 105–109.

    MATH  MathSciNet  Google Scholar 

  3. (with D. Turzik) On amalgamation of graphs and essential sets of generators,Comment. Math. Univ. Carolinae 19 (1979) 359–369.

    MathSciNet  Google Scholar 

  4. (with D. Turzik) Some equivalent formulations of the intersection problem of finitely generated classes of graphs,Acta Sci. Math. 41 (1979) 357–374.

    MATH  MathSciNet  Google Scholar 

  5. (with V. Rödl) Orthogonal partitions and covering of graphs,Czechoslovak Mathematical Journal 105 (1980) 475–485.

    Google Scholar 

  6. (with D. Turzik) Weak join of matroids, in:Proc. 8th Winter School on Abstract Analysis, Math. Institute Czech. Acad. Sci. (1980) 130–133.

  7. (with J. Nesetril) Geometric and algebraic aspects of combinatorial optimization (in Czech),SOFSEM 1980, pp. 35–77.

  8. (with J. Nesetril and D. Turzik) Amalgamation of matroids and its applications,J. Combinatorial Theory. Series B 31 (1981) 9–22.

    Article  MATH  MathSciNet  Google Scholar 

  9. (with V. Rödl) On the arc-chromatic number of a digraph,J. Combinatorial Theory. Series B 31 (1981) 190–198.

    MATH  Google Scholar 

  10. (with A. Pultr) On the dimension of trees,Discrete Mathematics 34 (1981) 165–171.

    Article  MATH  MathSciNet  Google Scholar 

  11. (with V. Rödl) On set systems determined by intersections,Discrete Mathematics 34 (1981) 173–184.

    Article  MATH  MathSciNet  Google Scholar 

  12. (with V. Rödl and D. Turzik) Complexity of representing graphs by set systems,Discrete Applied Mathematics 3 (1981) 301–312.

    Article  MATH  MathSciNet  Google Scholar 

  13. (with A. Pultr and V. Rödl) On the dimension of Kneser graphs, in: L. Lovász and V.T. Sós, eds.,Algebraic Methods in Graph Theory, Colloquia Mathematica Societatis János Bolyai, Vol. 25 (North-Holland, Amsterdam, 1981) 631–646.

    Google Scholar 

  14. (with D. Turzik) A note of dimension ofP n3 ,Czechoslovak Mathematical Journal 106 (1981) 484–487.

    MathSciNet  Google Scholar 

  15. (with A. Pultr) Representing graphs by means of strong and weak products,Comment. Math. Univ. Carolinae 22 (1981) 449–466.

    MATH  MathSciNet  Google Scholar 

  16. (with D. Turzik and P. Pudlák) Extension ofk-subsets toK + 1-subsets — Existence versus constructability,Comment. Math. Univ. Carolinae 23 (1982) 337–349.

    MATH  Google Scholar 

  17. (with D. Turzik) A polynomial algorithm for constructing a large bipartite subgraph with an application to satisfiability problem,Canadian Mathematical Journal 24 (1982) 519–524.

    MathSciNet  Google Scholar 

  18. (with D. Turzik) A note on sticky matroids,Discrete Mathematics 42 (1982) 119–123.

    Article  MATH  MathSciNet  Google Scholar 

  19. (with M. Sura) An algorithm for graceful labelling of trees,Ars Combinatoria 14 (1982) 57–66.

    MATH  MathSciNet  Google Scholar 

  20. (with A. Pultr and V. Rödl) On qualitatively independent partitions and related problems,Discrete Applied Mathematics 6 (1983) 193–205.

    Article  MATH  MathSciNet  Google Scholar 

  21. (with V. Rödl) On classes of graphs determined by forbidden subgraphs,Czechoslovak Mathematical Journal 108 (1983) 27–33.

    Google Scholar 

  22. (with M. Sura) On periodical behaviour in societies with symmetrical relations,Combinatorica 3 (1983) 119–121.

    Article  MATH  MathSciNet  Google Scholar 

  23. (with M. Sura) On a construction of graceful trees, in: M. Fiedler, ed.,Graphs and Other Combinatorial Topics, Proceedings of the Third Czechoslovakian Symposium on Graph Theory (Prague, 1982), Teubner-Texte zur Mathematik, Vol. 59 (Teubner, Leipzig, 1983) 220–222.

    Google Scholar 

  24. (with A. Pultr and V. Rödl) On a product dimension of bipartite graphs,J. Graph Theory 7 (1983) 475–486.

    MATH  MathSciNet  Google Scholar 

  25. (with D. Turzik) On systems, periods and semipositive mappings,Comment. Math. Univ. Carolinae 25 (1984) 597–614.

    MATH  MathSciNet  Google Scholar 

  26. (with D. Turzik) Amalgamation over uniform matroids,Czechoslovak Mathematical Journal 109 (1984) 239–246.

    MathSciNet  Google Scholar 

  27. (with D. Turzik) Amalgamation of matroids along hypergraphs, in: A. Hajnal, L. Lovász and V.T. Sós, eds.,Finite and Infinite Sets, Colloquia Mathematica Societatis János Bolyai, Vol. 37 (North-Holland, Amsterdam, 1984) 607–620.

    Google Scholar 

  28. (with J. Nesetril and D. Turzik) Some remarks on the Ramsey matroids, in:Proceedings of the 11th Winter School on Abstract Analysis, Rendiconto del Circolo Matematico di Palermo. Serie II. Supplemento 3 (1984) 185–189.

  29. (with D. Turzik) On social influence models with ranking alternatives and local election rules,Mathematical Social Sciences 10 (1985) 189–198.

    Article  MATH  MathSciNet  Google Scholar 

  30. (with J. Pelant) Extensions of cyclically monotone mappings, in:Proceedings of the 13th Winter School on Abstract Analysis, Rendiconto del Circolo Matematico di Palermo. Serie II. Supplemento 11 (1985) 81–88.

  31. (with J. Nesetril) On the complexity of the subgraph problem,Comment. Math. Univ. Carolinae 26 (1985) 415–419.

    MATH  MathSciNet  Google Scholar 

  32. (with J. Nesetril and D. Turzik) Special amalgams of matroids, in: L. Lovász and A. Recski, eds.Matroid Theory, Colloquia Mathematica Societatis János Bolyai, Vol. 40 (North-Holland, Amsterdam, 1985) 267–298.

    Google Scholar 

  33. (with J. Nesetril) A note on max-cut problem with an application to discrete-analogue convertors,Operations Research Letters 4 (1986) 289–191.

    Article  MATH  MathSciNet  Google Scholar 

  34. (with D. Turzik) On an application of convexity to discrete systems,Discrete Applied Mathematics 13 (1986) 27–32.

    Article  MATH  MathSciNet  Google Scholar 

  35. (with D. Turzik) On pre-periods of discrete influence systems,Discrete Applied Mathematics 13 (1986) 33–39.

    Article  MATH  MathSciNet  Google Scholar 

  36. (with D. Turzik) A polynomial heuristic for certain subgraph optimization problems with guaranteed lower bound,Discrete Mathematics 58 (1986) 99–104.

    Article  MATH  MathSciNet  Google Scholar 

  37. (with J. Pelant and D. Turzik) Limit behaviour of trajectories involving subgradients of convex functions,Comment. Math. Univ. Carolinae 28 (1987) 457–466.

    MATH  MathSciNet  Google Scholar 

  38. (with D. Turzik) On a facet of the balanced subgraph polytope,Cas. Pest. Matem. 112 (1987) 373–380.

    MATH  MathSciNet  Google Scholar 

  39. (with M. Chrobak) A generalization of Smith’s Theorem,Zastosowania Matematyki. Applicationes Mathematicae XIX (1987) 371–374.

    MathSciNet  Google Scholar 

  40. (with Zs. Tuza) Maximum bipartite subgraphs of Kneser graphs,Graphs and Combinatorics 3 (1987) 191–199.

    Article  MATH  MathSciNet  Google Scholar 

  41. Transformations on graphs and convexity,Complex Systems 1 (1987) 1021–1033.

  42. (with M. Loebl) Matroids induced by packing subgraphs,J. Combinatorial Theory. Series B 44 (1988) 338–354.

    Article  MATH  MathSciNet  Google Scholar 

  43. (with D. Turzik) Subgradients of convex functions and periodical behaviour of finite automata, in:Proceedings of Inst. Chem. Tech., Prague, M 2 (1988) 75–86.

  44. (with M. Loebl) On the union of matching matroids,Mathematica Slovaca 38 (1988) 301–304.

    MATH  MathSciNet  Google Scholar 

  45. (with M. Loebl) Bipartite packing, in:Combinatorics, Eger, Hungary, 1987, Colloquia Mathematica Societatis János Bolyai, Vol. 52 (North-Holland, Amsterdam, 1988) 375–384.

    Google Scholar 

  46. (with M. Chrobak) On common edges in optimal solutions to travelling salesman and other optimization problems,Discrete Applied Mathematics 20 (1988) 101–111.

    Article  MATH  MathSciNet  Google Scholar 

  47. (with V. Rödl and J. Spencer) Polynomial time algorithm for tournament ranking that ensures the expected profit,SIAM J. Discrete Mathematics 1 (1988) 372–376.

    Article  MATH  Google Scholar 

  48. (with Zs. Tuza) Improved bounds for the number of qualitatively independent partitions,J. Combinatorial Theory. Series A 51 (1989) 111–116.

    Article  MATH  MathSciNet  Google Scholar 

  49. Maximum rank of powers of a matrix of a given pattern,Proceedings AMS 106 (1989) 1137–1144.

  50. (with M. Loebl) A hierarchy of totally unimodular matrices,Discrete Mathematics 76 (1989) 241–246.

    Article  MATH  MathSciNet  Google Scholar 

  51. (with P. Alles) Long induced paths and cycles in Kneser graphs,Graphs and Combinatorics 5 (1989) 303–306.

    Article  MATH  MathSciNet  Google Scholar 

  52. On the generic dimension of controllable subspaces,IEEE Transactions on Automatic Control 35 (3) (1990) 367–369.

  53. (with M. Loebl) Subgraph packing — A survey,Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel (Physica-Verlag, Heidelberg, 1990) 491–503.

    Google Scholar 

  54. (with K. Murota) Note on a graph-theoretic criterion for structural output controllability,IEEE Transactions on Automatic Control 35 (8) (1990) 939–942.

    Article  MATH  MathSciNet  Google Scholar 

  55. (with B. Mohar) Eigenvalues and the max-cut problem,Czechoslovak Mathematical Journal 40 (115) (1990) 343–352.

    MathSciNet  Google Scholar 

  56. (with M. Kano) Graphs with the Balas-Uhry property,J. Graph Theory 14 (1990) 623–628.

    MATH  MathSciNet  Google Scholar 

  57. (with P. Alles and J. Nesetril) Extendability, dimensions and diagrams for cyclic orders,SIAM J. Discrete Mathematics 4 (1991) 453–471.

    Article  MATH  MathSciNet  Google Scholar 

  58. (with M. Schlegel) Computing generic Jordan canonical form,Linear and Multilinear Algebra 28 (1991) 241–249.

    MathSciNet  Google Scholar 

  59. (with T. Ibaraki) Weak three-linking in Eulerian digraphs,SIAM J. Discrete Mathematics 4 (1991) 84–98

    Article  MATH  MathSciNet  Google Scholar 

  60. Coloring digraphs by iterated antichains,Comment. Math. Univ. Carolinae 32 (2) (1991) 209–212.

    Google Scholar 

  61. Polyhedral and eigenvalue approximations of the max-cut problem, in: G. Halász, L. Lovász, D. Miklós and T. Szönyi, eds.,Sets, Graphs and Numbers, Colloquia Mathematica Societatis János Bolyai, Vol. 60 (North-Holland, Amsterdam, 1992) 569–581.

    Google Scholar 

  62. (with M. Loebl) Packing by families of subgraphs, in: M. Fiedler and J. Nesetril, eds.,Proceedings of the Fourth Czechoslovakian Symposium on Combinatorics, Graph Theory and Complexity, Annals of Discrete Mathematics, Vol. 51 (North-Holland, Amsterdam, 1992) 181–186.

    Google Scholar 

  63. (with Y. Crama and M. Loebl) On line balancing of strongly unimodular matrices,Discrete Applied Mathematics 102 (1992) 143–147.

    Article  MATH  MathSciNet  Google Scholar 

  64. (with M. Deza and M. Laurent) Facets of the cut cone III: The role of triangle facets,Graphs and Combinatorics 8 (1992) 125–142.

    Article  MATH  MathSciNet  Google Scholar 

  65. (with M. Laurent) The metric polytope, in: E. Balas, G. Cornuejols and R. Kannan, eds.,Proceedings of IPCO (1992) 274–286.

  66. Minimum spectral radius of a weighted graph,Linear Algebra and Its Applications 171 (1992) 53–63.

  67. (with J. Kratochvíl) Compatible two-factors,Discrete Applied Mathematics 36 (1992) 253–266.

    Article  MATH  MathSciNet  Google Scholar 

  68. (with D. Turzik) Maximum cut in circulant graphs,Discrete Mathematics 108 (1992) 379–392.

    Article  MATH  MathSciNet  Google Scholar 

  69. On the gap between structural controllability of time-invariant and time-varying systems,IEEE Transactions on Automatic Control 37 (1992) 1961–1965.

  70. (with Ch. Delorme) The performance of an eigenvalue bound in some classes of graphs, in:Proceedings of the Conference on Combinatorics, Marseille, 1990, Discrete Mathematics 111 (1993) 145–156.

  71. On existence theorems, in:Proceedings of the Conference on Combinatorics, Marseille, 1990, Discrete Mathematics 122 (1993) 423–434.

  72. (with B. Mohar) Eigenvalue methods in combinatorial optimization, in: R. Brualdi, S. Friedland and V. Klee, eds.,Combinatorial and Graph-Theoretic Problems in Linear Algebra, The IMA Volumes in Mathematics and its Applications, Vol. 50 (Springer, Berlin, 1993) 107–151.

    Google Scholar 

  73. (with J. Bang-Jensen) Eulerian trials through a set of terminals in specific, unique and all orders, in: N. Robertson and P. Seymour, eds.,Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint Summer Conference, Seattle, 1991, Contemporary Mathematics, Vol. 147 (American Mathematical Society, Providence, RI, 1993) 247–258.

    Google Scholar 

  74. (with Ch. Delorme) Combinatorial properties and the complexity of an eigenvalue approximation of the max-cut problem,European J. Combinatorics 14 (1993) 313–333.

    Article  MATH  MathSciNet  Google Scholar 

  75. (with J. Rohn) Checking robust nonsingularity is NP-hard,Mathematics of Control, Signals and Systems 6 (1993) 1–9.

    Article  MATH  MathSciNet  Google Scholar 

  76. (with Ch. Helmberg, B. Mohar, and F. Rendl) A spectral approach to bandwidth and separator problems in graphs, in: G. Rinaldi and L. Wolsey, eds.,Proceedings of the Third IPCO Conference (1993) 183–194.

  77. (with M. Loebl) Efficient subgraph packing,J. Combinatorial Theory, Series B 59 (1993) 106–121.

    Article  MATH  MathSciNet  Google Scholar 

  78. (with Ch. Delorme) Laplacian eigenvalues and the maximum cut problem,Mathematical Programming 62 (1993) 557–574.

    Article  MathSciNet  Google Scholar 

  79. (with T. Nishizeki)K-connectivity and decomposition of graphs into forests,Discrete Applied Mathematics 55 (1994) 295–301.

    Article  MATH  MathSciNet  Google Scholar 

  80. (with Zs. Tuza) Bipartite subgraphs of triangle free graphs,SIAM J. Discrete Mathematics 7 (1994) 307–314.

    Article  MATH  MathSciNet  Google Scholar 

  81. (with F. Rendl) Computational experiments with node and edge relaxations of the max-cut problem,Computing 52 (1994) 123–137.

    Article  MATH  MathSciNet  Google Scholar 

  82. (with Zs. Tuza) On the expected relative error of the polyhedral approximation of the max-cut,Operation Research Letters 16 (1994) 191–198.

    Article  MATH  MathSciNet  Google Scholar 

  83. (with F. Rendl) Computing the max-cut by eigenvalues,Annals of Operation Research, to appear.

  84. (with F. Rendl) Nonpolyhedral relaxation of graph-bisection problems,SIAM J. Optimization 5 (1995) 467–487.

    Article  MATH  MathSciNet  Google Scholar 

  85. (with Ch. Helmberg, B. Mohar, and F. Rendl) A spectral approach to bandwidth and separator problems in graphs,Linear and Multilinear Algebra, to appear.

  86. (with G. Hahn and P. Hell) On the ultimate independence ratio of a graph, Report No. 91717-OR (Institut für Diskrete Mathematik, Universität Bonn),European J. Combinatorics 16 (1955), to appear.

  87. (with M. Laurent) One-third-integrality in the max-cut problem,Mathematical Programming 71 (1996) 29–50.

    MathSciNet  Google Scholar 

  88. Integer linear programs and local search,SIAM J. Computing 24 (1995) 822–839.

  89. (with H. Wolkowicz) Convex relaxations of 0–1 quadratic programming,Mathematics of Operation Research 20 (1995) 550–561.

    Article  MATH  MathSciNet  Google Scholar 

  90. (with M. Laurent) On a positive semidefinite relaxation of the cut polytope,Linear Algebra and Its Applications 223/224 (1995) 439–461.

    Article  MathSciNet  Google Scholar 

  91. (with Zs. Tuza) Max-cut — A survey, Preprint, Academia Sinica, 1993.

  92. (with Zs. Tuza) Maximum cuts and largest bipartite subgraphs, in: W. Cook, L. Lovasz, and P. Seymour, eds.,Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 20 (American Mathematical Society, Providence, RI, 1995) 181–244.

    Google Scholar 

  93. (with M. Laurent) On the facial structure of the set of correlation matrices,SIAM J. Matrix Analysis and Applications 17 (1996) 530–547.

    Article  MATH  MathSciNet  Google Scholar 

  94. (with M. Laurent and F. Rendl) Connections between semidefinite relaxations of the max-cut and stable set problems,Mathematical Programming 77 (1997) 225–246.

    Article  MathSciNet  Google Scholar 

  95. (with F. Rendl and H. Wolkowicz) A recipe for semidefinite relaxation for (0,1)-quadratic programming,J. Global Optimization 7 (1995) 51–73.

    Article  MATH  MathSciNet  Google Scholar 

  96. (with M. Laurent)European J. Combinatorics (1996), to appear.

  97. (with D. Turzik) The probability of exact graphs, in preparation.

  98. (with F. Rendl and H. Wolkowicz) A semidefinite programming approach to integer programming. in: E. Balas and J. Clausen, eds.,Proceedings of the 4th International IPCO Conference, Lecture Notes in Computer Science, Vol. 920 (Springer, Berlin, 1995) 124–134.

    Google Scholar 

  99. Neural networks via convexity and linear programming, submitted.

  100. (with Ch. Delorme) Nonlinear relaxation of graph partition problems, in preparation.

  101. (with V. Rödl) Average discrepancy of a set system, in preparation.

  102. (with C. DeSimone, Ch. Helmberg, F. Rendl and G. Rinaldi) Polyhedral and semidefinite relaxations for the max-cut problem, in preparation.

Download references

Rights and permissions

Reprints and permissions

About this article

Cite this article

In memory of Svatopluk Poljak. Mathematical Programming 77, 97–104 (1997). https://doi.org/10.1007/BF02614430

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02614430

Search

Navigation