A note on panchromatic colorings (Q1690224): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 23:21, 14 July 2024

scientific article

Language	Label	Description	Also known as
English	A note on panchromatic colorings	scientific article

Statements

scholarly article

0 references

A note on panchromatic colorings (English)

0 references

Danila Cherkashin

0 references

Discrete Mathematics

0 references

publication date

19 January 2018

0 references

full work available at URL

https://arxiv.org/abs/1705.03797

0 references

zbMATH Keywords

hypergraph colorings

0 references

panchromatic colorings

0 references

MaRDI profile type

MaRDI publication profile

0 references

Choice Numbers of Graphs: a Probabilistic Approach

0 references

0 references

On a combinatorial problem. II

0 references

0 references

0 references

On the construction of 3-chromatic hypergraphs with few edges

0 references

On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs

0 references

0 references

Density conditions for panchromatic colourings of hypergraphs

0 references

Greedy colorings of uniform hypergraphs

0 references

The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems

0 references

Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph

0 references

The existence of panchromatic colourings for uniform hypergraphs

0 references

On a generalization of Rubin's theorem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.disc.2017.10.030

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1690224

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1690224&oldid=36366608"