Cover Image

Tight constructions for reconfigurations of independent transversals

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wdowinski, Ronen
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Constructing graphs with no independent transversals
by: Haxell, Penny, et al.
Published: (2023)

Hall's theorem for reconfigurations and higher dimensional topological connectedness
by: Wdowinski, Ronen
Published: (2025)

Bounded degree graphs and hypergraphs with no full rainbow matchings
by: Wdowinski, Ronen
Published: (2024)

Counting independent sets in percolated graphs via the Ising model
by: Geisler, Anna, et al.
Published: (2025)

A precise condition for independent transversals in bipartite covers
by: Cambie, Stijn, et al.
Published: (2023)

Degree criteria and stability for independent transversals
by: Penny Haxell, et al.
Published: (2024)

Sampling from the antiferromagnetic Ising model on bipartite, regular expander graphs
by: Geisler, Anna, et al.
Published: (2026)

Block-weighted random graphs: planar and beyond
by: Kang, Mihyun, et al.
Published: (2026)

Partial independent transversals in multipartite graphs
by: Haxell, Penny, et al.
Published: (2025)

Approximate packing of independent transversals in locally sparse graphs
by: Chakraborti, Debsoumya, et al.
Published: (2024)

Tight bound for independent domination of cubic graphs without $4$-cycles
by: Cho, Eun-Kyung, et al.
Published: (2021)

TAR reconfiguration for vertex set parameters
by: Curtis, Bryan A., et al.
Published: (2024)

Nowhere-zero flow reconfiguration
by: Esperet, Louis, et al.
Published: (2025)

Basis sequence reconfiguration in the union of matroids
by: Hanaka, Tesshu, et al.
Published: (2024)

Tight cuts in matching covered graphs
by: Lu, Fuliang, et al.
Published: (2026)

Tight Hamilton cycles with high discrepancy
by: Gishboliner, Lior, et al.
Published: (2023)

The tape reconfiguration problem and its consequences for dominating set reconfiguration
by: Bousquet, Nicolas, et al.
Published: (2025)

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

A Tight Lower bound on Trees in Graphs
by: Wilson, Chase
Published: (2025)

Tight bounds towards Zarankiewicz problem in hypergraph
by: Gao, Guorong, et al.
Published: (2025)

Tight bounds for judicious 3-partitions of graphs
by: Kuang, Peiru, et al.
Published: (2025)

Hamilton transversals in tournaments
by: Chakraborti, Debsoumya, et al.
Published: (2023)

Asymptotically Tight Bound for the Conflict-Free Chromatic Index
by: Kamyczura, Mateusz, et al.
Published: (2026)

The complexity of matroid homomorphism reconfiguration
by: Heo, Cheolwon, et al.
Published: (2025)

The minimum number of maximal independent sets in graphs with given order and independence number
by: Tian, Yuting, et al.
Published: (2024)

Tightness of the weight-distribution bound for strongly regular polar graphs
by: Evans, Rhys J., et al.
Published: (2024)

Tight general bounds for the extremal numbers of 0-1 matrices
by: Janzer, Barnabás, et al.
Published: (2024)

Characterizations of transversal and fundamental transversal matroids
by: Bonin, Joseph E., et al.
Published: (2010)

Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs
by: Caro, Yair, et al.
Published: (2024)

Number of independent transversals in multipartite graphs
by: Tang, Yantao, et al.
Published: (2025)

Universality for transversal powers of Hamilton cycles
by: Heath, Emily, et al.
Published: (2025)

Stability of transversal Hamilton cycles and paths
by: Cheng, Yangyang, et al.
Published: (2024)

On a transversal theorem of Montejano and Karasev
by: Holmsen, Andreas F.
Published: (2021)

Eulerian $k$-dominating reconfiguration graphs
by: Messinger, M. E., et al.
Published: (2024)

Tight paths in convex geometric hypergraphs
by: Füredi, Zoltán, et al.
Published: (2017)

Parameterised algorithms for temporally satisfying reconfiguration problems
by: Davot, Tom, et al.
Published: (2025)

Tight bounds for intersection-reverse sequences, edge-ordered graphs and applications
by: Janzer, Barnabás, et al.
Published: (2024)

Tight upper bounds on the hop domination number of triangle-free graphs
by: Fujita, Shinya, et al.
Published: (2025)

A note on finding large transversals efficiently
by: Anastos, Michael, et al.
Published: (2024)

On the $d$-transversal number of cylindrical and toroidal grids
by: Wu, Hailun, et al.
Published: (2025)