245 problems
Determine whether there exists an absolute constant such that, for every integer , there is a constant for which every weakly -degenerate ordered -unifo…
For a finite triple system , consider triple systems that omit and have uncountable chromatic number. (a) If one exists, must one exist with cardinality at most…
Characterize those finite 3-uniform hypergraphs which appear in every 3-uniform hypergraph of chromatic number .
For all integers , let be the complete -partite -uniform hypergraph with vertices in each part. Is it true that, for every real , all su…
For integers , let be the family of all -uniform hypergraphs with vertices and edges. Determine the extremal number…
For integers and , determine … where is the spectral radius of the adjacency tensor of the -uniform hypergraph with edge set .…
An -uniform hypergraph, or -graph, is a vertex set together with a collection of -element subsets called edges. For fixed integers , an -configuration is…
Let be sets with , and let be any two-coloring. Is it always possible to find countably infinite subsets…
For integers , let be the family of all 3-uniform hypergraphs with exactly vertices and edges. Write for the maximum number of e…
Fix an integer . An -uniform hypergraph is a pair with ; write . The question asks whether there is a constant ,…
For a positive integer , let range over 3-uniform hypergraphs with , so each edge is a 3-element subset of . Require that distinct edges meet in at most one…
For each positive integer , is there a real constant , with as , such that the following implication holds? Let be a finite family o…
For an integer , let be a finite -uniform hypergraph: is a finite set and . A coloring of is proper if no edge is mon…
For a finite -uniform hypergraph , let denote its number of vertices and its number of edges. For , the question defines using the f…
Let be an integer, and let be a finite -uniform hypergraph: is a family of -element subsets of , and, as in the set-family convention,…
For a finite set , write for its family of -element subsets, and let . Does there exist an integer , a set with , and…
The question as stated is: “Does there exist a -critical -uniform hypergraph in which every vertex has degree at least ?” Here a -uniform hypergraph (or -graph)…
Let be a set and let be a family of subsets of . Call -chromatic if can be partitioned into classes, none of which contai…
For an integer , let be a finite -uniform hypergraph: is a finite vertex set and every edge in is an -element subset of . Its chromatic number…
Let n be a positive integer and let G=(V,E) be a 3-uniform hypergraph, meaning that E is a set of 3-element subsets of V. Is it true that for every such G with |V|=3n and |E|≥n^3+1…
Let be positive integers, let , and write for the family of all -element subsets of . Suppose … For every coloring…
A finite simple -uniform hypergraph has . A set is complete if every -element subset of is an edge; a clique is a complet…
For each positive integer , let and choose uniformly an -element subset of , where . Denote the…
Let be the maximum number of -edges that can be placed on vertices without forming a (the -uniform complete graph on vertic…
Let be the family of all -uniform hypergraphs with six vertices and three edges. Is ?