By eliminating the win condition in the game of Connect Four and extending the board to infinite height, a rich state space of positions is obtained. We investigate the number of positions reachable on an \(n\)-column board after \(k\) color-alternating moves. For fixed \(k\) we demonstrate polynomiality, derive a partial formula for the polynomial coefficients, and precisely characterize the asymptotic behavior as \(n \to \infty\). We then turn our attention to the fixed-\(n\) case and show that, under a natural addition operation, positions reachable in an even number of moves form a monoid with a highly symmetric finite generating set; by examining certain free submonoids, we bound the exponential growth rate as \(k \to \infty\).

Sterboul’s theorem characterizes non-Kőnig–Egerváry graphs by the presence, relative to a maximum matching, of a flower or a posy. In this paper we translate that obstruction into the language of perfect flowers and the core of the graph. We introduce core-defective perfect flowers: perfect flowers whose alternating path contains a vertex at odd distance from the blossom base that does not belong to the core. We prove first that every Kőnig–Egerváry graph is core-rigid: in every perfect flower, all odd-distance vertices of the attaching path lie in the core. Conversely, if \(G\) is connected and is not an odd cycle, then \(G\) is non-Kőnig–Egerváry if and only if \(G\) contains a core-defective perfect flower. Thus, among connected graphs different from an odd cycle, the Kőnig–Egerváry graphs are exactly the graphs with no core-defective perfect flower. In the matchable case the statement strengthens: if \(G\) has a perfect matching, then being non-Kőnig–Egerváry is equivalent to the existence of a core-defective perfect flower for some maximum matching, and also equivalent to the existence of one for every maximum matching. We include examples and counterexamples showing why odd cycles, disconnected graphs, and the universal quantifier over maximum matchings require separate treatment.

A hypergraph \(H\) is said to be \(r\)-partite \(r\)-uniform if its vertex set \(V\) can be partitioned into non-empty sets \(V_1, V_2, \cdots, V_r\) so that every edge in the edge set \(E(H)\), consists of precisely one vertex from each set \(V_i\), \(i=1,2,\cdots,r\). It is denoted as \(H^r(V_1,V_2,\cdots,V_r)\) or \(H^r_{(n_1,n_2,\cdots,n_r)}\) if \(|V_i|=n_i\) for \(i=1,2,\cdots,r\). There exists an \(r\)-partite self-complementary \(r\)-uniform hypergraph \(H^r(V_1,V_2,\cdots,V_r)\) where \(|V_i|=n_i\) for \(i=1,2,\cdots,r\) if and only if at least one of \(n_1,n_2,\cdots,n_r\) is even. And there exists an \(r\)-partite almost self-complementary \(r\)-uniform hypergraph \(H^r(V_1, V_2,\cdots,V_r)\) where \(|V_i|=n_i\) for \(i=1,2,\cdots,r\) if and only if \(n_1,n_2,\cdots,n_r\) are odd. In this paper, we prove the existence of regular \(3\)-partite self-complementary \(3\)-uniform hypergraphs. Further we prove there does not exist a regular \(3\)-partite almost self-complementary \(3\)-uniform hypergraph.

We study the difference between the numbers of even and odd permutations in \(\mathfrak{S}_n\) having exactly \(k\) fixed points. We derive a closed formula for this quantity using four complementary approaches: exponential generating functions, a determinant representation, a combinatorial derivation based on inclusion–exclusion on cycle structures, and a factorization via the stabilizer subgroup, through restriction to the complement of the fixed-point set. The resulting expression provides a signed refinement of the classical rencontres numbers and yields a simple polynomial form for the associated signed fixed-point distribution.