Problems

In an intersecting r-partite hypergraph, what is the smallest size of a vertex cover that does not contain any edge or side?

Let b_t(n) denote the minimum number of edges induced by any set of n / 2 vertices in the Turán graph on n vertices for K_t .If each set of ⌊ n/2 ⌋ vertices in a graph G of order n spans more than b_t(n) edges, then G contains a K_t .

Conjecture 4.2. Let h≥1,(a_{1},...,a_{h})\in \mathbb{C}^{h} , and P(x)\in \mathbb{C}[x] . Set I_h,P,n(x)=P(x)∏_i=1^n(1+a_1x^F_i+a_2x^F_i+1+… +a_hx^F_i+h-1).Regarding h, P as fixed, let c_{n}(p) denote the coefficient of x^{p} in…

There exists a constant K such that for every integer m, where m ≥ K, there exists an integer n such that χ_st'(C_m square C_n) = 6.

Is it true that for sufficiently large n, indeed we can have min_i ∈[n]deg_B(i)deg_C(i)≤binomn-2k-2^2?

Does there exist a Hall function for the pairwise disjointness relation of the sets of a given family F?

Let 2≤ℓ<k and n ≠5. If G is an n-vertex k-chromatic ℓ -connected graph,then i(G)≤ i(G^*).

If A and B are finite sets of distinct vectors in R^n then show that the order of the set D(A, B) = d(a, b) : a ∈ A, b ∈ B is at least min|A|, |B|.

In addition, we conjecture that also (⌈n/2⌉ − k)-RCS is in P for any constant k.

(2) χ(G(2,8,6))=4?

(i) If T is a p-tree, then θ(T) is single-valued if p ≥ 6. (ii) If T is a p-tree, then for each p ≥ 7: θ(T)= llp-2 ifΔ(T)geqslant p-3, p-1 otherwise. .

For a given endofunction T, what is σ(d;T) ?

Every k-ary tangram T satisfies cut(T, S_k) ≤ c_k, for some finite constant c_k depending only on k.

If A is [k]^(4) then this set is precisely A itself, but is it always the case that (for |A| > 1) we have |S(A)| ≥ |A|?

If 2 ≤ c ≤ d, then β_2(K_d^2× K_c^2)=d(c-1).

The family of graphs G_4,0,r, where r ≠ c^3 + 4c^2 + 1 + q and c ∈ N, excluding the graphs G_4,0,4, G_4,0,9, G_4,0,10 and G_4,0,17, is a family of Galois equivalent graphs with each P(G_4,0,r, λ) having Galois group S_4.

Conjecture 3.7. Let k be a positive integer, G=(V,E) be a graph, and r:V \to Z_{+} such that r(V) ≥k+1. Then G has a k-connected r-detachment if and only if (a) G-Y is (k-r(Y))-edge connected for all Y \subseteq V with r(Y) ≤k-2, (b)…

K_{12t} minus a hamiltonian cycle K_{12t+3} minus a hamiltonian cycle K_{12t+8} plus a hamiltonian cycle can be decomposed into K_4's K_{12t+11} plus a hamiltonian cycle

A binary (or graphic) pregeometry of known cardinality and rank is reconstructible from its connected hyperplanes.

For any fixed k ≥0, the graphical Bell number sequence B(\overline{P_{n,k}}) is quasi geometric.