Saved in:
| Main Authors: | Gordeev, Alexey, Markström, Klas, Öhman, Lars-Daniel |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.07166 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Resolvable Triple Arrays
by: Gordeev, Alexey, et al.
Published: (2025)
by: Gordeev, Alexey, et al.
Published: (2025)
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
by: Jäger, Gerold, et al.
Published: (2019)
by: Jäger, Gerold, et al.
Published: (2019)
Enumeration of Row-Column Designs
by: Jäger, Gerold, et al.
Published: (2024)
by: Jäger, Gerold, 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)
An orderly algorithm for generation of Condorcet Domains
by: Zhou, Bei, et al.
Published: (2025)
by: Zhou, Bei, et al.
Published: (2025)
Arrow's single peaked domains, richness, and domains for plurality and the Borda count
by: Markström, Klas, et al.
Published: (2024)
by: Markström, Klas, et al.
Published: (2024)
Characterization of Word-Representable Near-Triangulations
by: Roy, Suchanda, et al.
Published: (2026)
by: Roy, Suchanda, et al.
Published: (2026)
Local Diversity of Condorcet Domains
by: Karpov, Alexander, et al.
Published: (2024)
by: Karpov, Alexander, et al.
Published: (2024)
Bipartite peak-pit domains
by: Karpov, Alexander, et al.
Published: (2023)
by: Karpov, Alexander, et al.
Published: (2023)
3-colorable planar graphs have an intersection segment representation using 3 slopes
by: Gonçalves, Daniel
Published: (2025)
by: Gonçalves, Daniel
Published: (2025)
Combinatorial Nullstellensatz Techniques
by: Freed, Daniel L.
Published: (2024)
by: Freed, Daniel L.
Published: (2024)
Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
by: Sawada, Joe, et al.
Published: (2025)
by: Sawada, Joe, et al.
Published: (2025)
Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
by: Bencs, Ferenc, et al.
Published: (2023)
by: Bencs, Ferenc, et al.
Published: (2023)
Orthology and Near-Cographs in the Context of Phylogenetic Networks
by: Lindeberg, Anna, et al.
Published: (2025)
by: Lindeberg, Anna, et al.
Published: (2025)
On the expansion of Hanoi graphs
by: Eppstein, David, et al.
Published: (2025)
by: Eppstein, David, et al.
Published: (2025)
Branch-depth is minor closure of contraction-deletion-depth
by: Briański, Marcin, et al.
Published: (2024)
by: Briański, Marcin, et al.
Published: (2024)
Twin-width of graphs on surfaces
by: Kráľ, Daniel, et al.
Published: (2023)
by: Kráľ, Daniel, et al.
Published: (2023)
Closure property of contraction-depth of matroids
by: Brianski, Marcin, et al.
Published: (2023)
by: Brianski, Marcin, et al.
Published: (2023)
Contact graphs of boxes with unidirectional contacts
by: Gonçalves, Daniel, et al.
Published: (2023)
by: Gonçalves, Daniel, et al.
Published: (2023)
Larger Nearly Orthogonal Sets over Finite Fields
by: Haviv, Ishay, et al.
Published: (2024)
by: Haviv, Ishay, et al.
Published: (2024)
Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)
by: Dippel, Jack, et al.
Published: (2025)
Forcing quasirandomness with 4-point permutations
by: Kráľ, Daniel, et al.
Published: (2024)
by: Kráľ, Daniel, et al.
Published: (2024)
Comparing Width Parameters on Graph Classes
by: Brettell, Nick, et al.
Published: (2023)
by: Brettell, Nick, et al.
Published: (2023)
Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure
by: Dadush, Daniel, et al.
Published: (2025)
by: Dadush, Daniel, et al.
Published: (2025)
Improved lower bounds for the maximum size of Condorcet domains
by: Karpov, Alexander, et al.
Published: (2026)
by: Karpov, Alexander, et al.
Published: (2026)
Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)
by: Beaudou, Laurent, et al.
Published: (2025)
Balanced-chromatic number and Hadwiger-like conjectures
by: Jiménez, Andrea, et al.
Published: (2023)
by: Jiménez, Andrea, et al.
Published: (2023)
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
by: Bok, Jan, et al.
Published: (2020)
by: Bok, Jan, et al.
Published: (2020)
The treewidth and pathwidth of graph unions
by: Alecu, Bogdan, et al.
Published: (2022)
by: Alecu, Bogdan, et al.
Published: (2022)
Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)
by: Botler, Fábio, et al.
Published: (2023)
Optimal Repair Bandwidth and Repair I/O of $(n,n-2,2)$ MDS Array Codes
by: Wu, Huawei
Published: (2026)
by: Wu, Huawei
Published: (2026)
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)
by: Lozin, Vadim, et al.
Published: (2022)
An Alternate Proof of Near-Optimal Light Spanners
by: Bodwin, Greg
Published: (2023)
by: Bodwin, Greg
Published: (2023)
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)
Similar Items
-
Resolvable Triple Arrays
by: Gordeev, Alexey, et al.
Published: (2025) -
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
by: Jäger, Gerold, et al.
Published: (2019) -
Enumeration of Row-Column Designs
by: Jäger, Gerold, 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) -
An orderly algorithm for generation of Condorcet Domains
by: Zhou, Bei, et al.
Published: (2025)