Image de couverture de livre

Manhattan and Chebyshev flows

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gáborik, Lukáš, Kurz, Sascha, Mazzuoccolo, Giuseppe, Rajník, Jozef, Rieg, Florian
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Geometric description of $d$-dimensional flows of a graph
par: Mattiolo, Davide, et autres
Publié: (2025)

A lower bound for the complex flow number of a graph: A geometric approach
par: Davide Mattiolo, et autres
Publié: (2024)

Cages and cyclic connectivity
par: Lukoťka, Robert, et autres
Publié: (2025)

Strictly critical snarks with girth or cyclic connectivity equal to 6
par: Mazák, Ján, et autres
Publié: (2024)

Expanding vertices to triangles in cubic graphs
par: Mazzuoccolo, Giuseppe, et autres
Publié: (2025)

Equivalent bounded confidence processes
par: Kurz, Sascha
Publié: (2025)

Simple games with minimum
par: Kurz, Sascha, et autres
Publié: (2025)

Optimal additive quaternary codes of dimension $3.5$ and $4$
par: Kurz, Sascha
Publié: (2024)

Bounds on the minimum distance of locally recoverable codes
par: Kurz, Sascha
Publié: (2023)

Divisible Codes
par: Kurz, Sascha
Publié: (2021)

Trifferent codes with small lengths
par: Kurz, Sascha
Publié: (2023)

Computer classification of linear codes based on lattice point enumeration and integer linear programming
par: Kurz, Sascha
Publié: (2024)

Lengths of divisible codes -- the missing cases
par: Kurz, Sascha
Publié: (2023)

Exponential odd-distance sets under the Manhattan metric
par: Díaz, Alberto Espuny, et autres
Publié: (2024)

Open problems of the 33rd Workshop on Cycles and Colourings
par: Barát, János, et autres
Publié: (2025)

Nodal surfaces in $\mathbb{P}^3$ and coding theory
par: Kurz, Sascha
Publié: (2025)

Cubic graphs with edges in exactly one perfect matching
par: Goedgebeur, Jan, et autres
Publié: (2024)

Linear codes for $b$-symbol read channels attaining the Griesmer bound
par: Kurz, Sascha
Publié: (2025)

Additive codes attaining the Griesmer bound
par: Kurz, Sascha
Publié: (2024)

Non-projective two-weight codes
par: Kurz, Sascha
Publié: (2024)

Optimal codes and arcs for the generalized Hamming weights
par: Kurz, Sascha, et autres
Publié: (2026)

On the existence of factors intersecting sets of cycles in regular graphs
par: Goedgebeur, Jan, et autres
Publié: (2024)

Constructions and bounds for subspace codes
par: Kurz, Sascha
Publié: (2021)

The Pairing-Hamiltonian property in graph prisms
par: Abreu, Marién, et autres
Publié: (2023)

Generalized ovals, 2.5-dimensional additive codes, and multispreads
par: Krotov, Denis S., et autres
Publié: (2025)

Divisible minimal codes
par: Chubenko, Vladimir, et autres
Publié: (2023)

Generalized Hamming weights of additive codes and geometric counterparts
par: D'haeseleer, Jozefien, et autres
Publié: (2025)

On null completely regular codes in Manhattan metric
par: Mogilnykh, I. Yu., et autres
Publié: (2025)

Chebyshev polynomials, their remarkable properties and connection with Catalan numbers
par: Ryabichev, Andrey, et autres
Publié: (2024)

Chebyshev centers and radius of the set of permutons
par: Maga, Balázs
Publié: (2026)

On gamma-vectors and Chow polynomials of restrictions of reflection arrangements
par: Degen, Sebastian, et autres
Publié: (2025)

Gamma vectors as inverted Chebyshev expansions, type A to B transformations, and connections to algebraic structures
par: Park, Soohyun
Publié: (2024)

A degree version of the Burr-Erdős conjecture on trees
par: Katz, Jasmin, et autres
Publié: (2026)

The square of a Hamilton cycle in randomly perturbed graphs
par: Böttcher, Julia, et autres
Publié: (2022)

The Ramsey numbers of squares of paths and cycles
par: Allen, Peter, et autres
Publié: (2022)

A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
par: Abreu, M., et autres
Publié: (2024)

Partitioning a 2-edge-coloured graph of minimum degree $2n/3 + o(n)$ into three monochromatic cycles
par: Allen, Peter, et autres
Publié: (2022)

Hamilton decompositions of regular tripartite tournaments
par: Di Braccio, Francesco, et autres
Publié: (2025)

On strongly walk regular graphs, triple sum sets and their codes
par: Kiermaier, Michael, et autres
Publié: (2020)

Beyond chromatic threshold via the $(p,q)$-theorem, and a sharp blow-up phenomenon
par: Liu, Hong, et autres
Publié: (2024)