On the largest chromatic number of $F$-free hypergraphs
Fuente:
arXiv
Guardado en:
| Autores principales: | Wang, Yichen, Duan, Mengyu, Gerbner, Dániel, Karim, Hilal Hama |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
On Turán-type problems and the abstract chromatic number
por: Gerbner, Dániel, et al.
Publicado: (2024)
por: Gerbner, Dániel, et al.
Publicado: (2024)
$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
por: Zaker, Manouchehr
Publicado: (2024)
por: Zaker, Manouchehr
Publicado: (2024)
5-Coloring Reconfiguration of Planar Graphs with No Short Odd Cycles
por: Cranston, Daniel W., et al.
Publicado: (2022)
por: Cranston, Daniel W., et al.
Publicado: (2022)
Genetic algorithm and edge-colorings of complete graphs with connected classes
por: Cervantes-Ojeda, Jorge, et al.
Publicado: (2024)
por: Cervantes-Ojeda, Jorge, et al.
Publicado: (2024)
Reflexive Digraph Reconfiguration by Orientation Strings
por: Pullas, David Emmanuel Pazmiño, et al.
Publicado: (2025)
por: Pullas, David Emmanuel Pazmiño, et al.
Publicado: (2025)
Recolouring Homomorphisms to triangle-free reflexive graphs
por: Lee, Jae-baek, et al.
Publicado: (2021)
por: Lee, Jae-baek, et al.
Publicado: (2021)
On the structure of (dart, odd hole)-free graphs
por: Hoàng, Chính T.
Publicado: (2025)
por: Hoàng, Chính T.
Publicado: (2025)
Sharp Bounds on Lengths of Linear Recolouring Sequences
por: Cambie, Stijn, et al.
Publicado: (2024)
por: Cambie, Stijn, et al.
Publicado: (2024)
Infinite families of planar graphs of a given injective chromatic number
por: Daneels, Matias, et al.
Publicado: (2024)
por: Daneels, Matias, et al.
Publicado: (2024)
Algorithms for the Generation of Snarks
por: Brinkmann, Gunnar, et al.
Publicado: (2026)
por: Brinkmann, Gunnar, et al.
Publicado: (2026)
On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
por: Zaker, Manouchehr
Publicado: (2024)
por: Zaker, Manouchehr
Publicado: (2024)
The connection between the chromatic numbers of a hypergraph and its $1$-intersection graph
por: Blázsik, Zoltán L., et al.
Publicado: (2024)
por: Blázsik, Zoltán L., et al.
Publicado: (2024)
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials
por: Dong, Fengming, et al.
Publicado: (2023)
por: Dong, Fengming, et al.
Publicado: (2023)
Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs
por: Jaworska, Justyna, et al.
Publicado: (2025)
por: Jaworska, Justyna, et al.
Publicado: (2025)
An algorithm for estimating the crossing number of dense graphs, and continuous analogs of the crossing and rectilinear crossing numbers
por: Solé-Pi, Oriol
Publicado: (2024)
por: Solé-Pi, Oriol
Publicado: (2024)
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)
por: Dong, Fengming, et al.
Publicado: (2022)
por: Dong, Fengming, et al.
Publicado: (2022)
The 2-domination number of cylindrical graphs
por: Martínez, José Antonio, et al.
Publicado: (2024)
por: Martínez, José Antonio, et al.
Publicado: (2024)
5-Coloring Planar Graphs with a Color Class of Order at Most $|V|/6$
por: Inoue, Yuta, et al.
Publicado: (2025)
por: Inoue, Yuta, et al.
Publicado: (2025)
Local Search Improvements for Soft Happy Colouring
por: Shekarriz, Mohammad Hadi, et al.
Publicado: (2025)
por: Shekarriz, Mohammad Hadi, et al.
Publicado: (2025)
Coloring graphs as complete graph invariants
por: Asgarli, Shamil, et al.
Publicado: (2025)
por: Asgarli, Shamil, et al.
Publicado: (2025)
The dib-chromatic number of digraphs
por: Javier-Nol, Nahid, et al.
Publicado: (2024)
por: Javier-Nol, Nahid, et al.
Publicado: (2024)
Induced planar Turán numbers
por: Győri, Ervin, et al.
Publicado: (2026)
por: Győri, Ervin, et al.
Publicado: (2026)
A combinatorial bound on the number of distinct eigenvalues of a graph
por: Allred, Sarah, et al.
Publicado: (2022)
por: Allred, Sarah, et al.
Publicado: (2022)
The integer $\{2\}$-domination number of grids
por: Lee, Jia-Ying, et al.
Publicado: (2025)
por: Lee, Jia-Ying, et al.
Publicado: (2025)
Finding hypergraph immersion is fixed-parameter tractable
por: Meng, Xiangyi, et al.
Publicado: (2024)
por: Meng, Xiangyi, et al.
Publicado: (2024)
On the dib-chromatic number of a digraph
por: Montellano-Ballesteros, Juan José, et al.
Publicado: (2025)
por: Montellano-Ballesteros, Juan José, et al.
Publicado: (2025)
On the difference between the chromatic and cochromatic number
por: Steiner, Raphael
Publicado: (2024)
por: Steiner, Raphael
Publicado: (2024)
On the number of small edge-weighted subgraphs
por: Yu, Feng, et al.
Publicado: (2025)
por: Yu, Feng, et al.
Publicado: (2025)
About Berge-Füredi's conjecture on the chromatic index of hypergraphs
por: Bretto, Alain, et al.
Publicado: (2024)
por: Bretto, Alain, et al.
Publicado: (2024)
On the pebbling numbers of Flower, Blanuša, and Watkins snarks
por: Adauto, Matheus, et al.
Publicado: (2023)
por: Adauto, Matheus, et al.
Publicado: (2023)
Linear-Time Computation of the Frobenius Normal Form for Symmetric Toeplitz Matrices via Graph-Theoretic Decomposition
por: Chu, Hojin, et al.
Publicado: (2025)
por: Chu, Hojin, et al.
Publicado: (2025)
Distinguishing chromatic number of middle and subdivision graphs
por: Banerjee, Amitayu, et al.
Publicado: (2024)
por: Banerjee, Amitayu, et al.
Publicado: (2024)
Extremal regular graphs of given chromatic number
por: Rubio-Montiel, Christian
Publicado: (2019)
por: Rubio-Montiel, Christian
Publicado: (2019)
A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets
por: Heering, Philipp, et al.
Publicado: (2026)
por: Heering, Philipp, et al.
Publicado: (2026)
Upper bounds for the list-distinguishing chromatic number
por: Banerjee, Amitayu, et al.
Publicado: (2024)
por: Banerjee, Amitayu, et al.
Publicado: (2024)
$5$-list-coloring toroidal $6$-regular triangulations in linear time
por: Balachandran, Niranjan, et al.
Publicado: (2021)
por: Balachandran, Niranjan, et al.
Publicado: (2021)
More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
por: Zaker, Manouchehr
Publicado: (2021)
por: Zaker, Manouchehr
Publicado: (2021)
Three results towards the approximation of special maximum matchings in graphs
por: Mkrtchyan, Vahan
Publicado: (2024)
por: Mkrtchyan, Vahan
Publicado: (2024)
$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses
por: Contreras-Mendoza, Fernando Esteban, et al.
Publicado: (2022)
por: Contreras-Mendoza, Fernando Esteban, et al.
Publicado: (2022)
Vertex-minor Ramsey numbers: exact values and extremal structure
por: Bae, Ji Ho
Publicado: (2026)
por: Bae, Ji Ho
Publicado: (2026)
Ejemplares similares
-
On Turán-type problems and the abstract chromatic number
por: Gerbner, Dániel, et al.
Publicado: (2024) -
$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
por: Zaker, Manouchehr
Publicado: (2024) -
5-Coloring Reconfiguration of Planar Graphs with No Short Odd Cycles
por: Cranston, Daniel W., et al.
Publicado: (2022) -
Genetic algorithm and edge-colorings of complete graphs with connected classes
por: Cervantes-Ojeda, Jorge, et al.
Publicado: (2024) -
Reflexive Digraph Reconfiguration by Orientation Strings
por: Pullas, David Emmanuel Pazmiño, et al.
Publicado: (2025)