3 papers
cs.AI2026
Improved Upper Bounds for Slicing the Hypercube
Duncan Soiffer, Nathaniel Itty, Christopher D. Rosin +5
A collection of hyperplanes slices all edges of the -dimensional hypercube with vertex set if, for every edge in the hypercube, there exists…
math.CO2024
B-colorings of planar and outerplanar graphs
Ryan R. Martin, Miklós Ruszinkó, Gábor N. Sárközy
A coloring of the edges of a graph in which every is totally multicolored is known as a proper coloring and a coloring of the edges of in which every an…
math.CO2018
Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs
Louis DeBiasio, András Gyárfás, Robert A. Krueger +2
It is well-known that in every -coloring of the edges of the complete bipartite graph there is a monochromatic connected component with at least vertices…