| Title: | Conformality of minimal transversals of maximal cliques |
|---|
| Authors: | ID Boros, Endre (Author)
ID Gurvich, Vladimir (Author)
ID Milanič, Martin (Author)
ID Tikhanovsky, Dmitry (Author)
ID Uno, Yushi (Author) |
|---|
| Files: |  RAZ_Boros_Endre_2026.pdf (1,65 MB)
MD5: 04AF3790F99DB379FC60E308C53240CF
 https://www.sciencedirect.com/science/article/pii/S0012365X25002651?via%3Dihub
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FAMNIT - Faculty of Mathematics, Science and Information Technologies
IAM - Andrej Marušič Institute
|
|---|
| Abstract: | Given a hypergraph ℋ, the dual hypergraph of ℋis the hypergraph of all minimal transversals of ℋ. A hypergraph is conformal if it is the family of maximal cliques of a graph. In a recent work, Boros, Gurvich, Milanič, and Uno (Journal of Graph Theory, 2025) studied conformality of dual hypergraphs and proved several results related to this property, leading in particular to a polynomial-time algorithm for recognizing graphs in which, for any fixed k, all minimal transversals of maximal cliques have size at most k. In this follow-up work, we provide a novel aspect to the study of graph clique transversals, by considering the dual conformality property from the perspective of graphs. More precisely, we study graphs for which the family of minimal transversals of maximal cliques is conformal. Such graphs are called clique dually conformal (CDC for short). It turns out that the class of CDC graphs is a rich generalization of the class of P4-free graphs. As our main results, we completely completely characterize CDC graphs within the families of triangle-free graphs and split graphs. Both characterizations lead to polynomial-time recognition algorithms. Generalizing the fact that every P4-free graph is CDC, we also show that the class of CDC graphs is closed under substitution, in the strong sense that substituting a graph H for a vertex of a graph G results in a CDC graph if and only if both G and H are CDC. |
|---|
| Keywords: | maximal clique, minimal transversal, conformal hypergraph, triangle-free graph, split graph |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 09.07.2025 |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | str. 1-25 |
|---|
| Numbering: | Vol. 349, iss. 1, [article no.] 114657 |
|---|
| PID: | 20.500.12556/RUP-22211  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 0012-365X |
|---|
| DOI: | 10.1016/j.disc.2025.114657 |
|---|
| COBISS.SI-ID: | 261722883 |
|---|
| Publication date in RUP: | 16.12.2025 |
|---|
| Views: | 206 |
|---|
| Downloads: | 2 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
