Cover Image

On minimum Venn diagrams

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brenner, Sofia, Gregor, Petr, Mütze, Torsten, Verciani, Francesco
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Disproving two conjectures on the Hamiltonicity of Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)

Flips in colorful triangulations
by: Acharya, Rohan, et al.
Published: (2024)

Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023)

Combinatorial Gray codes-an updated survey
by: Mütze, Torsten
Published: (2022)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)

Listing spanning trees of outerplanar graphs by pivot-exchanges
by: Behrooznia, Nastaran, et al.
Published: (2024)

Traversing combinatorial 0/1-polytopes via optimization
by: Merino, Arturo, et al.
Published: (2023)

Flipping odd matchings in geometric and combinatorial settings
by: Aichholzer, Oswin, et al.
Published: (2025)

Fractional domatic number and minimum degree
by: Chuet, Quentin, et al.
Published: (2025)

Facial diagrams and cycle double cover
by: Ghanbari, Babak, et al.
Published: (2026)

M-convexity of the minimum-cost packings of arborescences
by: Takazawa, Kenjiro
Published: (2018)

On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)

Network fault costs based on minimum leaf spanning trees
by: Goedgebeur, Jan, et al.
Published: (2025)

A Note on Polychromatic Colorings of Shift-Chains
by: Ueckerdt, Torsten
Published: (2024)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
by: Das, Sandip, et al.
Published: (2023)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
by: Gutin, Gregory, et al.
Published: (2024)

Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
by: Schneider, Samuel, et al.
Published: (2025)

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)

Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)

Graphs that admit a Hamilton path are cup-stackable
by: Gregor, Petr, et al.
Published: (2024)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

Edge densities of drawings of graphs with one forbidden cell
by: Hahn, Benedikt, et al.
Published: (2025)

Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)

Cops and Robber -- When Capturing is not Surrounding
by: Jungeblut, Paul, et al.
Published: (2023)

Partitioning a Planar Graph into two Triangle-Forests
by: Knauer, Kolja, et al.
Published: (2024)

Primal-Dual Cops and Robber
by: Ha, Minh Tuan, et al.
Published: (2023)

Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)

Tight bound on treedepth in terms of pathwidth and longest path
by: Hatzel, Meike, et al.
Published: (2023)

On polynomials associated to Voronoi diagrams of point sets and crossing numbers
by: Claverol, Mercè, et al.
Published: (2023)

Bond Polytope under Vertex- and Edge-sums
by: Kolman, Petr, et al.
Published: (2026)

Note on Min-k-Planar Drawings of Graphs
by: Hliněný, Petr, et al.
Published: (2024)

Stack and Queue Numbers of Graphs Revisited
by: Hliněný, Petr, et al.
Published: (2023)

Hereditary Graph Product Structure and $\cal H$-clique-width
by: Hliněný, Petr, et al.
Published: (2024)

Intersection Graphs with and without Product Structure
by: Merker, Laura, et al.
Published: (2024)

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
by: Bok, Jan, et al.
Published: (2021)

Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)

Multivariate Exploration of Metric Dilation
by: Banik, Aritra, et al.
Published: (2025)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)