Cover Image

On a question of Erdős and Gimbel on the cochromatic number

Fuente: arXiv

Saved in:

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

Similar Items

The difference between the chromatic and the cochromatic number of a random graph
by: Heckel, Annika
Published: (2024)

Colouring random graphs: Tame colourings
by: Heckel, Annika, et al.
Published: (2023)

On the difference between the chromatic and cochromatic number
by: Steiner, Raphael
Published: (2024)

Chromatic number and regular subgraphs
by: Janzer, Barnabás, et al.
Published: (2024)

Fractional chromatic number vs. Hall ratio
by: Steiner, Raphael
Published: (2024)

Rainbow Stackings of Random Edge-Colorings
by: Alon, Noga, et al.
Published: (2024)

The distribution of the maximum protection number in simply generated trees
by: Heuberger, Clemens, et al.
Published: (2023)

On the concentration of the chromatic number of random graphs
by: Surya, Erlang, et al.
Published: (2022)

Disproof of the Odd Hadwiger Conjecture
by: Kühn, Marcus, et al.
Published: (2025)

The clique chromatic number of sparse random graphs
by: Fernandez V, Manuel, et al.
Published: (2024)

Sharp Thresholds for Factors in Random Graphs
by: Burghart, Fabian, et al.
Published: (2024)

Colouring random subgraphs
by: Bukh, Boris, et al.
Published: (2023)

First-order asymptotics for the structure of the inhomogeneous random graph
by: Bet, Gianmarco, et al.
Published: (2023)

Universality for transversal Hamilton cycles in random graphs
by: Christoph, Micha, et al.
Published: (2025)

The 2-domination number of cylindrical graphs
by: Martínez, José Antonio, et al.
Published: (2024)

Oriented Colouring Graphs of Bounded Degree and Degeneracy
by: Clow, Alexander, et al.
Published: (2023)

Local Search Improvements for Soft Happy Colouring
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)

Monochromatic components with many edges in random graphs
by: Fox, Hannah, et al.
Published: (2025)

Trees with flowers: A catalog of integer partition and integer composition trees with their asymptotic analysis
by: Aíza, Ricardo Gómez
Published: (2024)

Balanced supersaturation and Turan numbers in random graphs
by: Jiang, Tao, et al.
Published: (2022)

The asymptotic $χ$-boundedness of hereditary families
by: Reed, Bruce, et al.
Published: (2025)

DP-Coloring of Graphs from Random Covers
by: Bernshteyn, Anton, et al.
Published: (2023)

On the number of linear uniform hypergraphs with linear girth constraint
by: Tian, Fang, et al.
Published: (2025)

Rainbow Erdős-Sós Conjectures
by: Crawford, Nicholas, et al.
Published: (2025)

Asymptotic enumeration of constrained bipartite, directed and oriented graphs by degree sequence
by: Greenhill, Catherine, et al.
Published: (2026)

An Erdos-Gallai conjecture for signed graphs
by: Wang, Lujia
Published: (2025)

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

Robustness of Erdős--Ko--Rado theorems on permutations and perfect matchings
by: Gunderson, Karen, et al.
Published: (2024)

The generalizations of Erdős matching conjecture for $t$-matching number
by: Zhang, Haixiang, et al.
Published: (2025)

Random intersection graphs with communities
by: van der Hofstad, Remco, et al.
Published: (2018)

On the maximum number of common neighbours in dense random regular graphs
by: Isaev, Mikhail, et al.
Published: (2023)

The number and structure of connected graphs with a fixed degree sequence
by: Bell, Sasha, et al.
Published: (2026)

Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity
by: Gao, Pu, et al.
Published: (2020)

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
by: Andrade, Mauricio Daros, et al.
Published: (2025)

Sharp thresholds for NAC-colourings and stable cuts in random graphs
by: Clinch, Katie, et al.
Published: (2025)

Gaussian random graphs and Ramsey numbers
by: Hunter, Zach, et al.
Published: (2025)

Catching a robber on a random $k$-uniform hypergraph
by: Erde, Joshua, et al.
Published: (2023)

Vertex-minor universality of a random graph
by: Chao, Ting-Wei, et al.
Published: (2026)

Growth rates of the bipartite Erdős-Gyárfás function
by: Li, Xihe, et al.
Published: (2021)

On fixing and distinguishing numbers of trees
by: Buchanan, Calum, et al.
Published: (2026)