## Abstract

A hypergraph H = (V, E) has the property Bk if there exists an assignment of two colors to V such that each edge contains at least k vertices of each color. A hypergraph is called simple if every two edges of it have at most one common vertex. We obtain a new lower bound for the minimal number of edges of n-uniform simple hypergraph without the property Bk.

Original language | English (US) |
---|---|

Pages (from-to) | 155-176 |

Number of pages | 22 |

Journal | Discrete Mathematics and Applications |

Volume | 32 |

Issue number | 3 |

DOIs | |

State | Published - Jun 1 2022 |

## Keywords

- colorings of hypergraphs
- property B
- simple hypergraphs

## ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics

## Fingerprint

Dive into the research topics of 'New lower bound for the minimal number of edges of simple uniform hypergraph without the property B_{k}'. Together they form a unique fingerprint.