Minimal vertex covers in infinite hypergraphs
type: Item
instance of: scholarly article
title: Minimal vertex covers in infinite hypergraphs
author: Tamás Csernák
author: Lajos Soukup
published in: Discrete Mathematics
publication date: 2023-02-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/2103.10340
Mathematics Subject Classification ID: 03Exx
Mathematics Subject Classification ID: 05Cxx
Mathematics Subject Classification ID: 05Dxx
zbMATH DE Number: 7655631
zbMATH Keywords: infinite hypergraph
zbMATH Keywords: vertex cover
zbMATH Keywords: minimal vertex cover
zbMATH Keywords: Shelah's revised GCH
zbMATH Keywords: almost disjoint
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3136756954
cites work: Minimal covers of infinite hypergraphs
cites work: On a property of families of sets
cites work: Conflict free colorings of (strongly) almost disjoint set-systems
cites work: On the minimal covering of infinite sets
cites work: Minimal covering sets for infinite set systems
cites work: The generalized continuum hypothesis revisited
cites work: Essentially disjoint families, conflict free colorings and Shelah's revised GCH
DOI: 10.1016/J.DISC.2022.113280
Recommended article: Minimal covers of infinite hypergraphs
Recommended article: Q4856276
Recommended article: Q3688431
Recommended article: On graphs with minimal eternal vertex cover number
Recommended article: Sets defining minimal vertex covers of uniform hypergraphs.
Recommended article: Q4711901
Recommended article: Sets defining minimal vertex covers
Recommended article: Minimal coverings of uniform hypergraphs and \(P\)-recursiveness
Recommended article: Enumeration and maximum number of minimal connected vertex covers in graphs
Recommended article: Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
copyright license: Creative Commons Attribution 4.0 International
description: scientific article; zbMATH DE number 7655631