Image de couverture de livre

Balanced colorings of Erdős-Rényi hypergraphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dhawan, Abhishek, Wang, Yuzhou
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Balanced independent sets and colorings of hypergraphs
par: Dhawan, Abhishek
Publié: (2023)

Chemically inspired Erdős-Rényi oriented hypergraphs
par: Garcia-Chung, Angel, et autres
Publié: (2023)

Fractional coloring via entropy
par: Dhawan, Abhishek
Publié: (2026)

Multigraph edge-coloring with local list sizes
par: Dhawan, Abhishek
Publié: (2023)

Independent sets and colorings of $K_{t,t,t}$-free graphs
par: Dhawan, Abhishek, et autres
Publié: (2025)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
par: Bernshteyn, Anton, et autres
Publié: (2024)

Toward Vu's conjecture
par: Bradshaw, Peter, et autres
Publié: (2025)

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

Palette Sparsification for Graphs with Sparse Neighborhoods
par: Dhawan, Abhishek
Publié: (2024)

The strong chromatic index of $K_{t,t}$-free graphs
par: Bi, Richard, et autres
Publié: (2026)

Three-chromatic geometric hypergraphs
par: Damásdi, Gábor, et autres
Publié: (2021)

On arborescence packing augmentation in hypergraphs
par: Hoppenot, Pierre, et autres
Publié: (2024)

Improved bounds for coloring locally sparse hypergraphs
par: Iliopoulos, Fotis
Publié: (2020)

Sharp Online Hardness for Large Balanced Independent Sets
par: Dhawan, Abhishek, et autres
Publié: (2025)

Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
par: Bangachev, Kiril, et autres
Publié: (2024)

The chromatic number of triangle-free hypergraphs
par: Li, Lina, et autres
Publié: (2022)

Erdős-Pósa property of tripods in directed graphs
par: Briański, Marcin, et autres
Publié: (2024)

Erdős--Pósa property of cycles that are far apart
par: Dujmović, Vida, et autres
Publié: (2024)

The Avoider-Enforcer game on hypergraphs of rank 3
par: Galliot, Florian, et autres
Publié: (2025)

A note on hypergraphs with asymmetric Ramsey properties
par: Sviridenkov, Vladimir
Publié: (2026)

Tight bound for the Erdős-Pósa property of tree minors
par: Dujmović, Vida, et autres
Publié: (2024)

Regular packing of rooted hyperforests with root constraints in hypergraphs
par: Hoppenot, Pierre, et autres
Publié: (2023)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
par: Adak, Rajat, et autres
Publié: (2025)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
par: Chekan, Vera, et autres
Publié: (2024)

The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem
par: Martínez-Sandoval, Leonardo, et autres
Publié: (2019)

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
par: Galliot, Florian, et autres
Publié: (2022)

Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property
par: Beaudou, Laurent, et autres
Publié: (2025)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
par: Kupavskii, Andrey, et autres
Publié: (2025)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
par: Meunier, Anthony, et autres
Publié: (2026)

A Method for Generating Connected Erdos-Renyi Random Graphs
par: Chinyaev, Boris
Publié: (2025)

Centered colorings and weak coloring numbers in minor-closed graph classes
par: Hodor, Jędrzej, et autres
Publié: (2026)

Linear colorings of graphs
par: Hilaire, Claire, et autres
Publié: (2025)

Flips in colorful triangulations
par: Acharya, Rohan, et autres
Publié: (2024)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
par: Hertz, Alain, et autres
Publié: (2021)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
par: Hertz, Alain, et autres
Publié: (2021)

Some progress on $t$-tone coloring
par: Bennett, Patrick, et autres
Publié: (2025)

Generalized DP-colorings of digraphs
par: Picasarri-Arrieta, Lucas, et autres
Publié: (2025)

On near optimal colorable graphs
par: Angeliya, C. U., et autres
Publié: (2025)

Equitable coloring of sparse graphs
par: Liu, Weichan, et autres
Publié: (2024)

Graceful coloring is computationally hard
par: Antony, Cyriac, et autres
Publié: (2024)