Odd graphs
On a certain numbering of the vertices of a hypergraph
On a conjecture of Frankl and Füredi.
On a property of neighborhood hypergraphs
The aim of the paper is to show that no simple graph has a proper subgraph with the same neighborhood hypergraph. As a simple consequence of this result we infer that if a clique hypergraph and a hypergraph have the same neighborhood hypergraph and the neighborhood relation in is a subrelation of such a relation in , then is inscribed into (both seen as coverings). In particular, if is also a clique hypergraph, then .
On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs.
On acyclic hypergraphs of minimal prime models.
On balancing of hypergraphs
On connections between hypergraphs and algebras
The aim of the present paper is to translate some algebraic concepts to hypergraphs. Thus we obtain a new language, very useful in the investigation of subalgebra lattices of partial, and also total, algebras. In this paper we solve three such problems on subalgebra lattices, other will be solved in [[Pio4]]. First, we show that for two arbitrary partial algebras, if their directed hypergraphs are isomorphic, then their weak, relative and strong subalgebra lattices are isomorphic. Secondly, we prove...
On decompositions of complete -uniform hypergraphs
On edge independence numbers and edge covering numbers of -uniform hypergraph
On families of weakly dependent random variables
Let be a family of random independent k-element subsets of [n] = 1,2,...,n and let denote a family of ℓ-element subsets of [n] such that the event that S belongs to depends only on the edges of contained in S. Then, the edges of are ’weakly dependent’, say, the events that two given subsets S and T are in are independent for vast majority of pairs S and T. In the paper we present some results on the structure of weakly dependent families of subsets obtained in this way. We also list...
On feasible sets of mixed hypergraphs.
On hypergraph coverings
On hypergraphs of maximal simple paths of a class of Hamiltonian graphs
On hypergraphs with every four points spanning at most two triples.
On randomly generated non-trivially intersecting hypergraphs.
On some influence of the weak subalgebra lattice on the subalgebra lattice.
On subgroupoid lattices of some finite groupoid.
On the chromatic number of simple triangle-free triple systems.
On the discrepancy of coloring finite sets.