Induced-bisecting families of bicolorings for hypergraphs

DOI10.1016/j.disc.2018.03.015zbMath1384.05118arXiv1610.00140OpenAlexW2795463224MaRDI QIDQ1744760

Niranjan Balachandran, Sudebkumar Prasant Pal, Rogers Mathew, Tapas Kumar Mishra

Publication date: 19 April 2018

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

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

zbMATH Keywords

separating familybisecting familieshypergraph bicoloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Geometric systems of unbiased representatives ⋮ Induced-bisecting families of bicolorings for hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On separating systems whose elements are sets of at most k elements
• On the intersections of polynomials and the Cayley-Bacharach theorem
• Induced-bisecting families of bicolorings for hypergraphs
• Parameterized Study of the Test Cover Problem
• Identification Keys and Diagnostic Tables: A Review
• On separating systems of a finite set
• Minimal completely separating systems
• On a problem concerning separating systems of a finite set
• Partially Polynomial Kernels for Set Cover and Test Cover

This page was built for publication: Induced-bisecting families of bicolorings for hypergraphs