Results 151 to 160 of about 56,309 (276)

Properties of Hereditary Hypergraphs and Middle Graphs [PDF]

open access: bronze, 1978
E. J. Cockayne   +2 more
openalex   +1 more source

Hypergraph coloring complexes

open access: yesDiscrete Mathematics, 2012
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most of the properties, which are known to be true for coloring complexes of graphs, break down in this more general ...
Aaron Dall   +2 more
openaire   +4 more sources

Split Hypergraphs

open access: yesSIAM Journal on Discrete Mathematics, 2008
13 ...
openaire   +3 more sources

Hypergraphs

open access: yes, 2022
Given a family S of five subsets of a 10-set, suppose |A△B|≥6 for all different A,B∈S. Prove that |A△B|=6 for all different A,B∈S.
openaire   +1 more source

Computational Drug Repositioning in Cardiorenal Disease: Opportunities, Challenges, and Approaches

open access: yes
PROTEOMICS, Volume 25, Issue 11-12, June 2025.
Paul Perco   +7 more
wiley   +1 more source

On chromaticity of hypergraphs

open access: yesDiscrete Mathematics, 2007
Let H=(X,E) be a simple hypergraph and let f(H,@l) denote its chromatic polynomial. Two hypergraphs H"1 and H"2 are chromatic equivalent if f(H"1,@l)=f(H"2,@l). The equivalence class of H is denoted by . Let K and H be two classes of hypergraphs. H is said to be chromatically characterized in K if for every H@?H@?K we have @?K=H@?K.
Ewa Łazuka, Mieczysław Borowiecki
openaire   +2 more sources

Community detection in hypergraphs via mutual information maximization

open access: yesScientific Reports
The hypergraph community detection problem seeks to identify groups of related vertices in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community labels and ...
Jürgen Kritschgau   +9 more
doaj   +1 more source

A Matrix Approach to Hypergraph Stable Set and Coloring Problems with Its Application to Storing Problem

open access: yesJournal of Applied Mathematics, 2014
This paper considers the stable set and coloring problems of hypergraphs and presents several new results and algorithms using the semitensor product of matrices. By the definitions of an incidence matrix of a hypergraph and characteristic logical vector
Min Meng, Jun-e Feng
doaj   +1 more source

Home - About - Disclaimer - Privacy