Image de couverture de livre

On arborescence packing augmentation in hypergraphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hoppenot, Pierre, Szigeti, Zoltán
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
par: Hoppenot, Pierre, et autres
Publié: (2024)

Regular packing of rooted hyperforests with root constraints in hypergraphs
par: Hoppenot, Pierre, et autres
Publié: (2023)

M-convexity of the minimum-cost packings of arborescences
par: Takazawa, Kenjiro
Publié: (2018)

Matroid-reachability-based decomposition into arborescences
par: Hörsch, Florian, et autres
Publié: (2024)

A Gray code for arborescences of tournaments
par: Bonamy, Marthe, et autres
Publié: (2026)

Determining a graph from its reconfiguration graph
par: Berthe, Gaétan, et autres
Publié: (2025)

Three-chromatic geometric hypergraphs
par: Damásdi, Gábor, et autres
Publié: (2021)

Edge open packing: further characterizations
par: Pandey, Arti, et autres
Publié: (2025)

The chromatic number of triangle-free hypergraphs
par: Li, Lina, et autres
Publié: (2022)

Balanced colorings of Erdős-Rényi hypergraphs
par: Dhawan, Abhishek, et autres
Publié: (2025)

Balanced independent sets and colorings of hypergraphs
par: Dhawan, Abhishek
Publié: (2023)

Fast algorithm for $S$-packing coloring of Halin graphs
par: Zhang, Xin, et autres
Publié: (2025)

On graph classes with constant domination-packing ratio
par: Bonamy, Marthe, et autres
Publié: (2025)

Edge open packing on subclasses of chordal graphs
par: Santra, Kamal
Publié: (2025)

A note on hypergraphs with asymmetric Ramsey properties
par: Sviridenkov, Vladimir
Publié: (2026)

Chemically inspired Erdős-Rényi oriented hypergraphs
par: Garcia-Chung, Angel, et autres
Publié: (2023)

The Avoider-Enforcer game on hypergraphs of rank 3
par: Galliot, Florian, et autres
Publié: (2025)

Note on polychromatic coloring of hereditary hypergraph families II
par: Pálvölgyi, Dömötör
Publié: (2026)

The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem
par: Martínez-Sandoval, Leonardo, et autres
Publié: (2019)

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
par: Galliot, Florian, et autres
Publié: (2022)

Compression with wildcards: Enumerating specific induced subgraphs, and packing them as well
par: Wild, Marcel
Publié: (2024)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
par: Meunier, Anthony, et autres
Publié: (2026)

Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n>24
par: Pierre, Laurent
Publié: (2016)

Counting simplicial pairs in hypergraphs
par: Barrett, Jordan, et autres
Publié: (2024)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
par: Nakajima, Tamio-Vesa, et autres
Publié: (2025)

A characterization of testable hypergraph properties
par: Joos, Felix, et autres
Publié: (2017)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
par: Bourneuf, Romain, et autres
Publié: (2025)

Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
par: Auger, David, et autres
Publié: (2024)

Improved bounds for coloring locally sparse hypergraphs
par: Iliopoulos, Fotis
Publié: (2020)

Aperiodic monotiles: from geometry to groups
par: Coulbois, Thierry, et autres
Publié: (2024)

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices
par: Devillez, Gauvain, et autres
Publié: (2018)

Contractions in perfect graph
par: Dupont-Bouillard, Alexandre, et autres
Publié: (2024)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
par: Hertz, Alain, et autres
Publié: (2021)

Maximum Eccentric Connectivity Index for Graphs with Given Diameter
par: Hauweele, Pierre, et autres
Publié: (2018)

Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
par: Beaudou, Laurent, et autres
Publié: (2016)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
par: Arkhipov, Pavel, et autres
Publié: (2024)

Domination and packing in graphs
par: Gómez, Renzo, et autres
Publié: (2024)

Asynchronous dynamics of isomorphic Boolean networks
par: Bridoux, Florian, et autres
Publié: (2024)

HIST-Critical Graphs and Malkevitch's Conjecture
par: Goedgebeur, Jan, et autres
Publié: (2024)

Grid Minors and Products
par: Dujmović, Vida, et autres
Publié: (2024)