Cover Image

Regular packing of rooted hyperforests with root constraints in hypergraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hoppenot, Pierre, Martin, Mathis, Szigeti, Zoltán
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
by: Hoppenot, Pierre, et al.
Published: (2024)

On arborescence packing augmentation in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2024)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

Three-chromatic geometric hypergraphs
by: Damásdi, Gábor, et al.
Published: (2021)

Edge open packing: further characterizations
by: Pandey, Arti, et al.
Published: (2025)

Balanced independent sets and colorings of hypergraphs
by: Dhawan, Abhishek
Published: (2023)

The chromatic number of triangle-free hypergraphs
by: Li, Lina, et al.
Published: (2022)

Balanced colorings of Erdős-Rényi hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2025)

Fast algorithm for $S$-packing coloring of Halin graphs
by: Zhang, Xin, et al.
Published: (2025)

On graph classes with constant domination-packing ratio
by: Bonamy, Marthe, et al.
Published: (2025)

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

Edge open packing on subclasses of chordal graphs
by: Santra, Kamal
Published: (2025)

Chemically inspired Erdős-Rényi oriented hypergraphs
by: Garcia-Chung, Angel, et al.
Published: (2023)

A note on hypergraphs with asymmetric Ramsey properties
by: Sviridenkov, Vladimir
Published: (2026)

The Avoider-Enforcer game on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2025)

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

The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem
by: Martínez-Sandoval, Leonardo, et al.
Published: (2019)

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2022)

Compression with wildcards: Enumerating specific induced subgraphs, and packing them as well
by: Wild, Marcel
Published: (2024)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
by: Meunier, Anthony, et al.
Published: (2026)

Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022)

Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)

Some polynomial classes for the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2026)

On the Word-Representability of 5-Regular Circulant Graphs
by: Roy, Suchanda, et al.
Published: (2025)

Characterizing traces of processes defined by precedence and response constraints: an order theory approach
by: Dukes, Mark, et al.
Published: (2023)

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

Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
by: Arras, Patrick, et al.
Published: (2024)

Counting simplicial pairs in hypergraphs
by: Barrett, Jordan, et al.
Published: (2024)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
by: Nakajima, Tamio-Vesa, et al.
Published: (2025)

Matroid-reachability-based decomposition into arborescences
by: Hörsch, Florian, et al.
Published: (2024)

A characterization of testable hypergraph properties
by: Joos, Felix, et al.
Published: (2017)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
by: Bourneuf, Romain, et al.
Published: (2025)

Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
by: Auger, David, et al.
Published: (2024)

Improved bounds for coloring locally sparse hypergraphs
by: Iliopoulos, Fotis
Published: (2020)

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices
by: Devillez, Gauvain, et al.
Published: (2018)

Aperiodic monotiles: from geometry to groups
by: Coulbois, Thierry, et al.
Published: (2024)

Contractions in perfect graph
by: Dupont-Bouillard, Alexandre, et al.
Published: (2024)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

Maximum Eccentric Connectivity Index for Graphs with Given Diameter
by: Hauweele, Pierre, et al.
Published: (2018)

Face covers and rooted minors in bounded genus graphs
by: Fiorini, Samuel, et al.
Published: (2025)