Cover Image

A Simple Construction of Tournaments with Finite and Uncountable Dichromatic Number

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Sadhukhan, Arpan
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C20, 05C15, 05C63
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Shift Graphs, Chromatic Number and Acyclic One-Path Orientations
by: Sadhukhan, Arpan
Published: (2023)

Dichromatic Number and Cycle Inversions
by: Charbit, Pierre, et al.
Published: (2024)

Circular Chromatic Numbers, Balanceability, Relation Algebras, and Network Satisfaction Problems
by: Bodirsky, Manuel, et al.
Published: (2025)

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
by: Caro, Yair, et al.
Published: (2025)

A star-comb lemma for infinite digraphs
by: Reich, Florian
Published: (2024)

An end degree for digraphs
by: Hamann, Matthias, et al.
Published: (2024)

Normal trees of digraphs
by: Reich, Florian
Published: (2024)

Halin's grid theorem for digraphs
by: Reich, Florian
Published: (2024)

Menger's theorem for ends of digraphs
by: Reich, Florian
Published: (2026)

On ubiquity problems in infinite digraphs
by: Hamann, Matthias, et al.
Published: (2026)

Ubiquity of oriented rays
by: Gut, Florian, et al.
Published: (2022)

On the ubiquity of oriented double rays
by: Gut, Florian, et al.
Published: (2023)

On a problem concerning integer distance graphs
by: Oravcová, Janka, et al.
Published: (2024)

On Proper Colorings of Functions
by: Csernák, Tamás
Published: (2022)

Distinguishing regular graphs from lists
by: Kwaśny, Jakub, et al.
Published: (2022)

Trivial coloring of Cartesian product of graphs
by: Csernák, Tamás
Published: (2023)

The Nash-Williams orientation theorem for graphs with countably many ends
by: Assem, Amena, et al.
Published: (2023)

Large flames in rooted acyclic digraphs without backward-infinite paths
by: Joó, Attila, et al.
Published: (2025)

A Note About Majority Colorings of Countable DAGs
by: Bosek, Bartłomiej, et al.
Published: (2024)

Labeled Chip-Firing on Undirected $k$-ary Trees
by: Inagaki, Ryota, et al.
Published: (2025)

The Rational Number Game
by: Bowler, Nathan, et al.
Published: (2023)

Extending graph total colorings to cell complexes
by: Dejter, Italo J.
Published: (2026)

All graphs are majority 3-choosable
by: Ouborny, Jan, et al.
Published: (2025)

Graphs of large girth
by: Reiher, Christian
Published: (2024)

Chain--collider--fork Decompositions of Transitive Tournament
by: Gunasekara, Ajani De Vas
Published: (2026)

Infinite grids in digraphs
by: Hamann, Matthias, et al.
Published: (2024)

Chip Firing on Directed $k$-ary Trees
by: Inagaki, Ryota, et al.
Published: (2024)

Permutation-based Strategies for Labeled Chip-Firing on $k$-ary Trees
by: Inagaki, Ryota, et al.
Published: (2025)

A strong Gram classification of non-negative unit forms of Dynkin type A
by: Gonzalez, J. A. Jimenez
Published: (2022)

On Chip-Firing on Undirected Binary Trees
by: Inagaki, Ryota, et al.
Published: (2024)

Hamiltonicity of Transitive Graphs Whose Automorphism Group Has $\Z_{p}$ as Commutator Subgroups
by: Lehner, Florian, et al.
Published: (2024)

Arc-distinguishing of orientations of graphs
by: Gorzkowska, Aleksandra, et al.
Published: (2024)

The classification of homomorphism homogeneous oriented graphs
by: Pavlica, Bojana, et al.
Published: (2024)

Forcing Quasirandomness in a Regular Tournament
by: Noel, Jonathan A., et al.
Published: (2025)

On Ramsey Properties of k-Majority Tournaments
by: Shapira, Asaf, et al.
Published: (2026)

Brooks' type theorems for coloring parameters of locally finite graphs and Konig's Lemma
by: Banerjee, Amitayu, et al.
Published: (2024)

Irreducible distinguishing colourings and the Axiom of Choice
by: Stawiski, Marcin
Published: (2026)

Structured sunflowers and canonical Ramsey properties
by: Sullivan, Rob, et al.
Published: (2026)

Acyclic and complete coloring of digraphs with the minimum and maximum possible numbers of colors
by: Olsen, Mika, et al.
Published: (2025)

On the list version of a conjecture of Erdős and Neumann-Lara
by: Harutyunyan, Ararat, et al.
Published: (2026)