Imagen de Portada

Independent transversals in bipartite correspondence-covers

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cambie, Stijn, Kang, Ross J.
Formato:	Preprint
Publicado:	2020
Materias:	Combinatorics 05C15, 05C35, 05D05
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Asymmetric list sizes in bipartite graphs
por: Alon, Noga, et al.
Publicado: (2020)

Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
por: Cambie, Stijn, et al.
Publicado: (2023)

List packing number of bounded degree graphs
por: Cambie, Stijn, et al.
Publicado: (2023)

The average solution of a TSP instance in a graph
por: Cambie, Stijn
Publicado: (2022)

Growth rates of the bipartite Erdős-Gyárfás function
por: Li, Xihe, et al.
Publicado: (2021)

Abundancy of $z$-\v Soltés' digraphs
por: Cambie, Stijn
Publicado: (2024)

The minimum number of maximal independent sets in twin-free graphs
por: Cambie, Stijn, et al.
Publicado: (2022)

Maximum ratio of (graph) irregularities
por: Cambie, Stijn, et al.
Publicado: (2026)

Towards the essence of Šoltés' problem
por: Cambie, Stijn
Publicado: (2024)

On the extrema of the mean subtree order of graphs
por: Cambie, Stijn, et al.
Publicado: (2025)

Sharp results for the Erdős, Pach, Pollack and Tuza problem
por: Cambie, Stijn, et al.
Publicado: (2025)

Hypergraph saturation for the bow tie
por: Cambie, Stijn, et al.
Publicado: (2024)

Note on extremal problems about connected subgraph sums
por: Cambie, Stijn, et al.
Publicado: (2025)

Bounding mean orders of sub-$k$-trees of $k$-trees
por: Cambie, Stijn, et al.
Publicado: (2023)

On Vizing's problem for triangle-free graphs
por: Kang, Ross J., et al.
Publicado: (2023)

Counting sunflowers with restricted matching number
por: Zhang, Haixiang, et al.
Publicado: (2026)

The generalizations of Erdős matching conjecture for $t$-matching number
por: Zhang, Haixiang, et al.
Publicado: (2025)

Trees maximizing the number of almost-perfect matchings
por: Cambie, Stijn, et al.
Publicado: (2022)

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

Ramsey problems for graphs in Euclidean spaces and Cartesian powers
por: Axenovich, Maria, et al.
Publicado: (2025)

On the main distance-based entropies: the eccentricity- and Wiener-entropy
por: Cambie, Stijn, et al.
Publicado: (2022)

On zero-sum Ramsey numbers modulo 3
por: Caro, Yair, et al.
Publicado: (2025)

Hilton-Milner theorem for $k$-multisets
por: Liao, Jiaqi, et al.
Publicado: (2023)

The maximal sum of sizes of cross intersecting families for multisets
por: Wang, Hongkui, et al.
Publicado: (2024)

Vu's conjecture holds for claw-free graphs
por: Cook, Linda, et al.
Publicado: (2025)

Independent domination in the graph defined by two consecutive levels of the $n$-cube
por: Kalinowski, Thomas, et al.
Publicado: (2023)

Sharp Bounds on Lengths of Linear Recolouring Sequences
por: Cambie, Stijn, et al.
Publicado: (2024)

The hard-core model in graph theory
por: Davies, Ewan, et al.
Publicado: (2025)

Odd-Ramsey numbers of complete bipartite graphs
por: Boyadzhiyska, Simona, et al.
Publicado: (2024)

Reconfiguration of Independent Transversals
por: Buys, Pjotr, et al.
Publicado: (2024)

Šoltés' hypergraphs
por: Cambie, Stijn
Publicado: (2024)

The maximum number of connected sets in regular graphs
por: Cambie, Stijn, et al.
Publicado: (2023)

Dense Matchings of Linear Size in Graphs with Independence Number 2
por: Yip, Jung Hon
Publicado: (2025)

Fractional list packing for layered graphs
por: Cambie, Stijn, et al.
Publicado: (2024)

Hoffman-London graphs: When paths minimize $H$-colorings among trees
por: Galvin, David, et al.
Publicado: (2025)

Long paths need not minimize $H$-colorings among trees
por: Galvin, David, et al.
Publicado: (2025)

Universality for transversal Hamilton cycles in random graphs
por: Christoph, Micha, et al.
Publicado: (2025)

An exact Ramsey number of large bipartite graphs versus odd wheel
por: Gupta, Sayan, et al.
Publicado: (2025)

Looms
por: Aharoni, Ron, et al.
Publicado: (2023)