Pages that link to "Item:Q2488941"

The following pages link to A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2 (Q2488941):

Displaying 8 items.

• On perfection and imperfection of one-realizations of a given set (Q294527) (← links)
• Maximum number of colors: C-coloring and related problems (Q408951) (← links)
• The smallest one-realization of a given set. III (Q742599) (← links)
• Smallest set-transversals of \(k\)-partitions (Q968226) (← links)
• On the structure of uniform one-realizations of a given set (Q1706427) (← links)
• More results on the smallest one-realization of a given set. II (Q1717199) (← links)
• The smallest uniform color-bounded hypergraphs which are one-realizations of a given set (Q2409524) (← links)
• Connected colourings of complete graphs and hypergraphs (Q5964989) (← links)