Symmetry in domination for hypergraphs with choice

DOI10.3390/sym9030046zbMath1423.05116OpenAlexW2599357038MaRDI QIDQ2333489

Brendan P. Lidral-Porter, Kyle P. Webb, Kenneth S. Berenhaut, Theodore H. Schoen

Publication date: 13 November 2019

Published in: Symmetry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/sym9030046

zbMATH Keywords

symmetryhypergraphchoicedominationhypertournament

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounding the number of hyperedges in friendship \(r\)-hypergraphs
• A model of procedural and distributive fairness
• Derandomizing random walks in undirected graphs using locally fair exploration strategies
• Deterministic walks with choice
• On fairness and randomness
• On score sets in tournaments
• Score lists in \( (h, k)\)-bipartite hypertournaments
• Choice functions over a finite set: A summary
• On \(k\)-hypertournament matrices
• On score sequences of \(k\)-hypertournaments
• Ideal structures of path independent choice functions
• On the vertex-pancyclicity of hypertournaments
• Note on the degree sequences of \(k\)-hypertournaments
• Scores, inequalities and regular hypertournaments
• Regular Hypertournaments and Arc-Pancyclicity
• Fairness, Resources, and Separation
• Uniform sampling ofk-hypertournaments
• On scores, losing scores and total scores in hypertournaments
• Defining Fairness in Reactive and Concurrent Systems

This page was built for publication: Symmetry in domination for hypergraphs with choice