Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem (2309.00098v4)

Published 31 Aug 2023 in math.CO, cs.CC, cs.DM, and cs.DS

Abstract: Given a hypergraph $\mathcal{H}$, the dual hypergraph of $\mathcal{H}$ is the hypergraph of all minimal transversals of $\mathcal{H}$. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraphs are the conformal Sperner hypergraphs, which correspond to the families of maximal cliques of graphs. All these notions play an important role in many fields of mathematics and computer science, including combinatorics, algebra, database theory, etc. In this paper we study conformality of dual hypergraphs and prove several results related to the problem of recognizing this property. In particular, we show that the problem is in co-NP and can be solved in polynomial time for hypergraphs of bounded dimension. In the special case of dimension $3$, we reduce the problem to $2$-Satisfiability. Our approach has an implication in algorithmic graph theory: we obtain a polynomial-time algorithm for recognizing graphs in which all minimal transversals of maximal cliques have size at most $k$, for any fixed $k$.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (72)
  1. The edge covering number of the intersection of two matroids. Discrete Math., 312(1):81–85, 2012.
  2. A characterization of claw-free CIS graphs and new results on the order of CIS graphs. In G. Coutinho, Y. Kohayakawa, V. F. dos Santos, and S. Urrutia, editors, Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2019, Belo Horizonte, Brazil, June 2-7, 2019, volume 346 of Electronic Notes in Theoretical Computer Science, pages 15–27. Elsevier, 2019.
  3. I. Anderson. Combinatorics of finite sets. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1987.
  4. On graphs whose maximal cliques and stable sets intersect. In Optimization problems in graph theory, volume 139 of Springer Optim. Appl., pages 3–63. Springer, Cham, 2018.
  5. T. Andreae and C. Flotow. On covering all cliques of a chordal graph. Discrete Math., 149(1-3):299–302, 1996.
  6. Clique-transversal sets of line graphs and complements of line graphs. Discrete Math., 88(1):11–20, 1991.
  7. A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inform. Process. Lett., 8(3):121–123, 1979.
  8. Clique transversal and clique independence on comparability graphs. Inform. Process. Lett., 58(4):181–184, 1996.
  9. On the desirability of acyclic database schemes. J. ACM, 30(3):479–513, 1983.
  10. C. Berge. Graphs and hypergraphs. Translated by Edward Minieka, volume 6 of North-Holland Math. Libr. Elsevier (North-Holland), Amsterdam, 1973.
  11. C. Berge. Hypergraphs. North-Holland Publishing Co., Amsterdam, 1989.
  12. B. Bollobás. Random graphs, volume 73 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, second edition, 2001.
  13. Clique-perfectness of complements of line graphs. Discrete Appl. Math., 186:19–44, 2015.
  14. An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension. Parallel Process. Lett., 10(4):253–266, 2000.
  15. Dual subimplicants of positive Boolean functions. Optim. Methods Softw., 10(2):147–156, 1998.
  16. Algorithmic aspects of neighborhood numbers. SIAM J. Discrete Math., 6(1):24–29, 1993.
  17. N. Chiarelli and M. Milanič. Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs. Discrete Appl. Math., 179:1–12, 2014.
  18. N. Chiarelli and M. Milanič. Linear separation of connected dominating sets in graphs. Ars Math. Contemp., 16(2):487–525, 2019.
  19. M. Chudnovsky. The Erdös-Hajnal conjecture—a survey. J. Graph Theory, 75(2):178–190, 2014.
  20. C. Comin and R. Rizzi. An improved upper bound on maximal clique listing via rectangular fast matrix multiplication. Algorithmica, 80(12):3525–3562, 2018.
  21. Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs. Algorithmica, 82(6):1547–1573, 2020.
  22. Optimal-size clique transversals in chordal graphs. J. Graph Theory, 89(4):479–493, 2018.
  23. A note on the size of minimal covers. Inform. Process. Lett., 102(2-3):124–126, 2007.
  24. Boolean functions. Theory, algorithms, and applications, volume 142 of Encycl. Math. Appl. Cambridge: Cambridge University Press, 2011.
  25. Two minimum dominating sets with minimum intersection in chordal graphs. Nordic J. Comput., 3(3):220–237, 1996.
  26. J. Edmonds and D. R. Fulkerson. Bottleneck extrema. J. Comb. Theory, 8:299–306, 1970.
  27. Blockers and antiblockers of stable matchings. Theor. Comput. Sci., 524:126–133, 2014.
  28. T. Eiter and G. Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput., 24(6):1278–1304, 1995.
  29. K. Engel. Sperner theory, volume 65 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 1997.
  30. Covering the cliques of a graph with vertices. volume 108, pages 279–289. 1992.
  31. F. Foucaud. Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes. J. Discrete Algorithms, 31:48–68, 2015.
  32. M. L. Fredman and L. Khachiyan. On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms, 21(3):618–628, 1996.
  33. D. R. Fulkerson. Blocking and anti-blocking pairs of polyhedra. Math. Program., 1:168–194, 1971.
  34. D. R. Fulkerson. Anti-blocking polyhedra. J. Comb. Theory, Ser. B, 12:50–71, 1972.
  35. Computers and intractability. A Series of Books in the Mathematical Sciences. W. H. Freeman and Co., San Francisco, CA, 1979.
  36. Imperfect and nonideal clutters: A common approach. Combinatorica, 23(2):283–302, 2003.
  37. P. Gilmore. Families of sets with faithful graph representation. IBM Research Note N.C., 184, 1962. Thomas J. Watson Research Center, Yorktown Heights, New York.
  38. M. C. Golumbic. Algorithmic graph theory and perfect graphs, volume 57 of Annals of Discrete Mathematics. Elsevier Science B.V., Amsterdam, second edition, 2004.
  39. V. Guruswami and C. Pandu Rangan. Algorithmic aspects of clique-transversal and clique-independent sets. Discrete Appl. Math., 100(3):183–202, 2000.
  40. V. Gurvich. On exact blockers and anti-blockers, ΔΔ\Deltaroman_Δ-conjecture, and related problems. Discrete Appl. Math., 159(5):311–321, 2011.
  41. V. Gurvich and M. Naumova. Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms. Ann. Math. Artif. Intell., 92(1):49–57, 2024.
  42. Cut-threshold graphs. Discrete Appl. Math., 30(2-3):163–179, 1991.
  43. R. M. Karp. Reducibility among combinatorial problems. In Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), The IBM Research Symposia Series, pages 85–103. Plenum, New York-London, 1972.
  44. A global parallel algorithm for the hypergraph transversal problem. Inform. Process. Lett., 101(4):148–155, 2007.
  45. On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theoret. Comput. Sci., 382(2):139–150, 2007.
  46. A new algorithm for the hypergraph transversal problem. In L. Wang, editor, Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, volume 3595 of Lecture Notes in Computer Science, pages 767–776. Springer, 2005.
  47. A. D. Korshunov. The number of monotone Boolean functions. Problemy Kibernet., (38):5–108, 272, 1981.
  48. Decomposable graphs and hypergraphs. J. Austral. Math. Soc. Ser. A, 36(1):12–29, 1984.
  49. Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. SIAM J. Comput., 9(3):558–565, 1980.
  50. C.-M. Lee. Algorithmic aspects of some variations of clique transversal and clique independent sets on graphs. Algorithms (Basel), 14(1):Paper No. 22, 14, 2021.
  51. Distance-hereditary graphs are clique-perfect. Discrete Appl. Math., 154(3):525–536, 2006.
  52. M. C. Lin and S. Vasiliev. Approximation algorithms for clique transversals on some graph classes. Inform. Process. Lett., 115(9):667–670, 2015.
  53. K. Liu and M. Lu. Complete-subgraph-transversal-sets problem on bounded treewidth graphs. J. Comb. Optim., 41(4):923–933, 2021.
  54. K. Makino and T. Kameda. Transformations on regular nondominated coteries and their applications. SIAM J. Discrete Math., 14(3):381–407, 2001.
  55. K. Makino and T. Uno. New algorithms for enumerating all maximal cliques. In Algorithm theory—SWAT 2004, volume 3111 of Lecture Notes in Comput. Sci., pages 260–272. Springer, Berlin, 2004.
  56. T. A. McKee. Logical aspects of combinatorial duality. Can. Math. Bull., 27:251–256, 1984.
  57. M. Milanič and Y. Uno. Upper clique transversals in graphs. In D. Paulusma and B. Ries, editors, Graph-Theoretic Concepts in Computer Science – 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers, volume 14093 of Lecture Notes in Comput. Sci., pages 432–446. Springer Nature Switzerland, 2023. Full version available at https://arxiv.org/abs/2309.14103.
  58. B. Mohar and R. Škrekovski. The Grötzsch theorem for the hypergraph of maximal cliques. Electron. J. Combin., 6:Research Paper 26, 13, 1999.
  59. C. Payan. Remarks on cliques and dominating sets in graphs. Ars Combin., 7:181–189, 1979.
  60. Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks, 5(3):237–252, 1975.
  61. A. Schrijver. Combinatorial optimization. Polyhedra and efficiency (3 volumes), volume 24 of Algorithms Comb. Berlin: Springer, 2003.
  62. Clique-transversal sets and clique-coloring in planar graphs. European J. Combin., 36:367–376, 2014.
  63. E. Sperner. Ein Satz über Untermengen einer endlichen Menge. Math. Z., 27(1):544–548, 1928.
  64. J. Tind. Blocking and antiblocking polyhedra. Ann. Discrete Math. 4, 159-174 (1979)., 1979.
  65. M. Tkáč and H.-J. Voss. On k𝑘kitalic_k-trestles in polyhedral graphs. Discuss. Math. Graph Theory, 22(1):193–198, 2002.
  66. A new algorithm for generating all the maximal independent sets. SIAM J. Comput., 6(3):505–517, 1977.
  67. D. B. West. Parameters of partial orders and graphs: packing, covering, and representation. In Graphs and order (Banff, Alta., 1984), volume 147 of NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., pages 267–350. Reidel, Dordrecht, 1985.
  68. D. B. West. Introduction to graph theory. Prentice Hall, Inc., Upper Saddle River, NJ, 1996.
  69. D. R. Woodall. Menger and König systems. Theor. Appl. Graphs, Proc. Kalamazoo 1976, Lect. Notes Math. 642, 620-635 (1978)., 1978.
  70. D. R. Woodall. Minimax theorems in graph theory. Selected topics in graph theory, 237-269 (1978)., 1978.
  71. W. Zang. Generalizations of Grillet’s theorem on maximal stable sets and maximal cliques in graphs. Discrete Math., 143(1-3):259–268, 1995.
  72. A. A. Zykov. Hypergraphs. Russ. Math. Surv., 29(6):89–156, 1974.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets