Cover Image

Vector Trifference

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bhandari, Siddharth, Khetan, Abhishek
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Upper Bound for the Size of a Trifferent Code
by: Bhandari, Siddharth, et al.
Published: (2024)

Trifferent codes with small lengths
by: Kurz, Sascha
Published: (2023)

Independent sets and colorings of $K_{t,t,t}$-free graphs
by: Dhawan, Abhishek, et al.
Published: (2025)

Multigraph edge-coloring with local list sizes
by: Dhawan, Abhishek
Published: (2023)

Fractional coloring via entropy
by: Dhawan, Abhishek
Published: (2026)

Balanced independent sets and colorings of hypergraphs
by: Dhawan, Abhishek
Published: (2023)

Toward Vu's conjecture
by: Bradshaw, Peter, et al.
Published: (2025)

Balanced colorings of Erdős-Rényi hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2025)

A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion
by: Agrawal, Akanksha, et al.
Published: (2024)

The strong chromatic index of $K_{t,t}$-free graphs
by: Bi, Richard, et al.
Published: (2026)

A Linear Kernel for Planar Vector Domination
by: Sahili, Mahabba El, et al.
Published: (2023)

Palette Sparsification for Graphs with Sparse Neighborhoods
by: Dhawan, Abhishek
Published: (2024)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
by: Bernshteyn, Anton, et al.
Published: (2024)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

Determining a graph from its reconfiguration graph
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)

Induced Minors and Region Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2025)

Self-Orthogonal Cellular Automata
by: Mariot, Luca, et al.
Published: (2025)

Progress on Self Identifying Codes
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)

Accelerated Cops and Robbers
by: Kinnersley, William B., et al.
Published: (2025)

Faces in rectilinear drawings of complete graphs
by: Balko, Martin, et al.
Published: (2025)

4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025)

Computer-assisted graph theory: a survey
by: Jooken, Jorik
Published: (2025)

String Graph Obstacles of High Girth and of Bounded Degree
by: Chudnovsky, Maria, et al.
Published: (2025)

Row Impartial Terminus
by: Gottlieb, Eric, et al.
Published: (2025)

On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces
by: Weiß, Meike, et al.
Published: (2025)

On expectations and variances in the hard-core model on bounded degree graphs
by: Davies, Ewan, et al.
Published: (2025)

Chromatic discrepancy of locally $s$-colourable graphs
by: Corsini, Timothée, et al.
Published: (2025)

On cuts of small chromatic number in sparse graphs
by: Aubian, Guillaume, et al.
Published: (2025)

What is and is not inside a Cayley graph?
by: Knauer, Kolja, et al.
Published: (2025)

How to see the forest for the trees
by: Bérczi-Kovács, Erika, et al.
Published: (2025)

Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
by: Bafna, Mehul, et al.
Published: (2025)

Throttling for metric dimension and its variants
by: Brimkov, Boris, et al.
Published: (2025)

Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)

On the order-diameter ratio of girth-diameter cages
by: Cambie, Stijn, et al.
Published: (2025)

Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)

Disproving two conjectures on the Hamiltonicity of Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)

Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
by: Gutin, Gregory, et al.
Published: (2025)