EUDML | Hypergraphs and intervals. II.

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Hypergraphs and intervals. II.”

Supersolvable orders and inductively free arrangements

Ruimei Gao, Xiupeng Cui, Zhe Li (2017)

Open Mathematics

Similarity:

In this paper, we define the supersolvable order of hyperplanes in a supersolvable arrangement, and obtain a class of inductively free arrangements according to this order. Our main results improve the conclusion that every supersolvable arrangement is inductively free. In addition, we assert that the inductively free arrangement with the required induction table is supersolvable.

Generalized sum-free subsets.

Caro, Yair (1990)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Maximum subsets of $(0, 1]$ with no solutions to $x + y = k z$ .

Chung, Fan R.K., Goldwasser, John L. (1996)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Hypergraphs and intervals

Ladislav Nebeský (1981)

Czechoslovak Mathematical Journal

Similarity:

The structure of maximum subsets of ${1, \dots, n}$ with no solutions to $a + b = k c$ .

Baltz, Andreas, Hegarty, Peter, Knape, Jonas, Larsson, Urban, Schoen, Tomasz (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A note on $K_{k, k}$ -cross free families.

Suk, Andrew (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity: