Rainbow copies of spanning subgraphs
Fuente:
arXiv
Saved in:
| Main Authors: | Cooper, Colin, Frieze, Alan |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Karp's patching algorithm on dense digraph
by: Frieze, Alan
Published: (2025)
by: Frieze, Alan
Published: (2025)
Binomial Random Matroids
by: Bennett, Patrick, et al.
Published: (2026)
by: Bennett, Patrick, et al.
Published: (2026)
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
by: Frieze, Alan, et al.
Published: (2023)
by: Frieze, Alan, et al.
Published: (2023)
Rainbow Trees in Hypercubes
by: Crawford, Nicholas, et al.
Published: (2025)
by: Crawford, Nicholas, et al.
Published: (2025)
The Rainbow Arborescence Problem on Cycles
by: Bérczi, Kristóf, et al.
Published: (2025)
by: Bérczi, Kristóf, et al.
Published: (2025)
Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)
by: Sudakov, Benny
Published: (2024)
Proper Rainbow Saturation Numbers for Cycles
by: Halfpap, Anastasia, et al.
Published: (2024)
by: Halfpap, Anastasia, et al.
Published: (2024)
List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)
by: Piecyk, Marta, et al.
Published: (2025)
Tree decompositions whose trees are subgraphs: An application of Simon's factorization
by: Bourneuf, Romain, et al.
Published: (2026)
by: Bourneuf, Romain, et al.
Published: (2026)
Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
by: Ai, Jiangdong, et al.
Published: (2025)
by: Ai, Jiangdong, et al.
Published: (2025)
Compression with wildcards: Enumerating specific induced subgraphs, and packing them as well
by: Wild, Marcel
Published: (2024)
by: Wild, Marcel
Published: (2024)
A complete $t$-intersection theorem for families of spanning trees
by: Iarovikova, Elizaveta, et al.
Published: (2025)
by: Iarovikova, Elizaveta, et al.
Published: (2025)
Listing spanning trees of outerplanar graphs by pivot-exchanges
by: Behrooznia, Nastaran, et al.
Published: (2024)
by: Behrooznia, Nastaran, et al.
Published: (2024)
Network fault costs based on minimum leaf spanning trees
by: Goedgebeur, Jan, et al.
Published: (2025)
by: Goedgebeur, Jan, et al.
Published: (2025)
tinygarden -- A java package for testing properties of spanning trees
by: Dubinsky, Manuel, et al.
Published: (2024)
by: Dubinsky, Manuel, et al.
Published: (2024)
Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates
by: Falgas-Ravry, Victor, et al.
Published: (2022)
by: Falgas-Ravry, Victor, et al.
Published: (2022)
Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)
by: Dailly, Antoine, et al.
Published: (2025)
Rainbow polygons for colored point sets in the plane
by: Flores-Peñaloza, David, et al.
Published: (2020)
by: Flores-Peñaloza, David, et al.
Published: (2020)
$χ$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
by: Bonamy, Marthe, et al.
Published: (2025)
by: Bonamy, Marthe, et al.
Published: (2025)
Basis Number of Graphs Excluding Minors
by: Geniet, Colin, et al.
Published: (2026)
by: Geniet, Colin, et al.
Published: (2026)
Rainbow Arborescence Conjecture
by: Bérczi, Kristóf, et al.
Published: (2024)
by: Bérczi, Kristóf, et al.
Published: (2024)
Largest common subgraph of two forests
by: Rautenbach, Dieter, et al.
Published: (2024)
by: Rautenbach, Dieter, et al.
Published: (2024)
Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
by: Chekan, Vera, et al.
Published: (2024)
by: Chekan, Vera, et al.
Published: (2024)
On the complexity of finding a spanning even tree in a graph
by: Hanaka, Tesshu, et al.
Published: (2024)
by: Hanaka, Tesshu, et al.
Published: (2024)
Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
by: Galby, Esther, et al.
Published: (2025)
by: Galby, Esther, et al.
Published: (2025)
Rapid mixing of the flip chain over non-crossing spanning trees
by: Anand, Konrad, et al.
Published: (2024)
by: Anand, Konrad, et al.
Published: (2024)
An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
by: An, Shinwoo, et al.
Published: (2025)
by: An, Shinwoo, et al.
Published: (2025)
Universal cycle constructions for k-subsets and k-multisets
by: Campbell, Colin, et al.
Published: (2026)
by: Campbell, Colin, et al.
Published: (2026)
The strong vertex span of trees
by: Grašič, Mateja, et al.
Published: (2024)
by: Grašič, Mateja, et al.
Published: (2024)
Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)
by: Gollin, J. Pascal, et al.
Published: (2025)
Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)
by: Berthe, Gaétan, et al.
Published: (2025)
A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
by: Bourneuf, Romain, et al.
Published: (2025)
by: Bourneuf, Romain, et al.
Published: (2025)
Induced Minors and Region Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2025)
by: Bonnet, Édouard, et al.
Published: (2025)
Self-Orthogonal Cellular Automata
by: Mariot, Luca, et al.
Published: (2025)
by: Mariot, Luca, et al.
Published: (2025)
Progress on Self Identifying Codes
by: Jean, Devin, et al.
Published: (2025)
by: Jean, Devin, et al.
Published: (2025)
Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)
by: Dailly, Antoine, et al.
Published: (2025)
Accelerated Cops and Robbers
by: Kinnersley, William B., et al.
Published: (2025)
by: Kinnersley, William B., et al.
Published: (2025)
Faces in rectilinear drawings of complete graphs
by: Balko, Martin, et al.
Published: (2025)
by: Balko, Martin, et al.
Published: (2025)
4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025)
by: Ochem, Pascal, et al.
Published: (2025)
Similar Items
-
Karp's patching algorithm on dense digraph
by: Frieze, Alan
Published: (2025) -
Binomial Random Matroids
by: Bennett, Patrick, et al.
Published: (2026) -
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
by: Frieze, Alan, et al.
Published: (2023) -
Rainbow Trees in Hypercubes
by: Crawford, Nicholas, et al.
Published: (2025) -
The Rainbow Arborescence Problem on Cycles
by: Bérczi, Kristóf, et al.
Published: (2025)