Chain method for panchromatic colorings of hypergraphs

DOI10.1016/J.DAM.2022.06.005MaRDI QIDQ2172391zbMATH OpenOpenAlexFDO

Authors Margarita Akhmejanova, József Balogh, D. A. Shabanov

Publication date 15 September 2022

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2008.03827

zbMATH Keywords

panchromatic coloringproper coloringproperty Buniform hypergraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Abstract: We deal with an extremal problem concerning panchromatic colorings of hypergraphs. A vertex $r$-coloring of a hypergraph $H$ is emph{panchromatic} if every edge meets every color. We prove that for every $3<rleqsqrt[3]n/(100lnn)$, every $n$-uniform hypergraph $H$ with $|E(H)|leqfrac120r^{2}left(fracnlnnight{)}^{fracr-1r}left(fracrr-1ight{)}^{n-1}$ has a panchromatic coloring with $r$ colors.

Recommendations

• Panchromatic colorings of random hypergraphs
• On panchromatic colourings of a random hypergraph
• The existence of panchromatic colourings for uniform hypergraphs
• On chromaticity of hypergraphs
• Extremal problems for panchromatic colourings of uniform hypergraphs
• Density conditions for panchromatic colourings of hypergraphs
• A general framework for hypergraph coloring
• Colorings of hypergraphs
• scientific article; zbMATH DE number 6986950
• Hypergraph colouring

Cites work

• A note on panchromatic colorings
• Asymptotic lower bounds for Ramsey functions
• Choice Numbers of Graphs: a Probabilistic Approach
• Equitable colorings of hypergraphs with few edges
• Extremal problems for panchromatic colourings of uniform hypergraphs
• Extremal problems in hypergraph colourings
• Greedy colorings of uniform hypergraphs
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• Improved bounds and algorithms for hypergraph 2-coloring
• On a combinatorial problem. II
• On a generalization of Rubin's theorem
• On a property of families of sets
• On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
• On the construction of 3-chromatic hypergraphs with few edges
• What we know and what we do not know about Turán numbers

Cited in

(6)

• Density conditions for panchromatic colourings of hypergraphs
• A note on panchromatic colorings
• Panchromatic 3-colorings of random hypergraphs
• The existence of panchromatic colourings for uniform hypergraphs
• Extremal problems for panchromatic colourings of uniform hypergraphs
• Note on polychromatic coloring of hereditary hypergraph families

This page was built for publication: Chain method for panchromatic colorings of hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172391)