Imagen de Portada

Balanced independent sets and colorings of hypergraphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Dhawan, Abhishek
Formato:	Preprint
Publicado:	2023
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Fractional coloring via entropy
por: Dhawan, Abhishek
Publicado: (2026)

Multigraph edge-coloring with local list sizes
por: Dhawan, Abhishek
Publicado: (2023)

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

Toward Vu's conjecture
por: Bradshaw, Peter, et al.
Publicado: (2025)

Note on polychromatic coloring of hereditary hypergraph families II
por: Pálvölgyi, Dömötör
Publicado: (2026)

Palette Sparsification for Graphs with Sparse Neighborhoods
por: Dhawan, Abhishek
Publicado: (2024)

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

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
por: Kelly, Tom, et al.
Publicado: (2018)

Polynomial-time recognition and maximum independent set in Burling graphs
por: Rzążewski, Paweł, et al.
Publicado: (2024)

Three-chromatic geometric hypergraphs
por: Damásdi, Gábor, et al.
Publicado: (2021)

On arborescence packing augmentation in hypergraphs
por: Hoppenot, Pierre, et al.
Publicado: (2024)

Improved bounds for coloring locally sparse hypergraphs
por: Iliopoulos, Fotis
Publicado: (2020)

Sharp Online Hardness for Large Balanced Independent Sets
por: Dhawan, Abhishek, et al.
Publicado: (2025)

The chromatic number of triangle-free hypergraphs
por: Li, Lina, et al.
Publicado: (2022)

Chemically inspired Erdős-Rényi oriented hypergraphs
por: Garcia-Chung, Angel, et al.
Publicado: (2023)

A note on hypergraphs with asymmetric Ramsey properties
por: Sviridenkov, Vladimir
Publicado: (2026)

The Avoider-Enforcer game on hypergraphs of rank 3
por: Galliot, Florian, et al.
Publicado: (2025)

Regular packing of rooted hyperforests with root constraints in hypergraphs
por: Hoppenot, Pierre, et al.
Publicado: (2023)

The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem
por: Martínez-Sandoval, Leonardo, et al.
Publicado: (2019)

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
por: Galliot, Florian, et al.
Publicado: (2022)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
por: Meunier, Anthony, et al.
Publicado: (2026)

Clustered independence and bounded treewidth
por: Knauer, Kolja, et al.
Publicado: (2023)

Rainbow polygons for colored point sets in the plane
por: Flores-Peñaloza, David, et al.
Publicado: (2020)

Centered colorings and weak coloring numbers in minor-closed graph classes
por: Hodor, Jędrzej, et al.
Publicado: (2026)

Flips in colorful triangulations
por: Acharya, Rohan, et al.
Publicado: (2024)

Linear colorings of graphs
por: Hilaire, Claire, et al.
Publicado: (2025)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
por: Hertz, Alain, et al.
Publicado: (2021)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
por: Hertz, Alain, et al.
Publicado: (2021)

Some progress on $t$-tone coloring
por: Bennett, Patrick, et al.
Publicado: (2025)

Generalized DP-colorings of digraphs
por: Picasarri-Arrieta, Lucas, et al.
Publicado: (2025)

Equitable coloring of sparse graphs
por: Liu, Weichan, et al.
Publicado: (2024)

Graceful coloring is computationally hard
por: Antony, Cyriac, et al.
Publicado: (2024)

On near optimal colorable graphs
por: Angeliya, C. U., et al.
Publicado: (2025)

Two questions on Kneser colorings
por: Inozemtsev, Eduard, et al.
Publicado: (2024)

Biclique immersions in graphs with independence number 2
por: Botler, Fábio, et al.
Publicado: (2023)

Nucleation-free independent graphs with implied nonedges
por: Cheng, Jialong, et al.
Publicado: (2025)

Equitable coloring of large bipartite graphs
por: Nikabadi, Amir
Publicado: (2026)

Induced matching treewidth and tree-independence number, revisited
por: Alon, Noga, et al.
Publicado: (2025)