discrete mathematics - n-rooks n-colors problem - Mathematics Stack Exchange

The problem goes as follows: $n$ colors are used to color the squares in a $n\times m$ chess board so that each color is used exactly $m$ times. Can you always place $n$ rooks on the board, so that

discrete mathematics - Hitori and graph connectivity - Mathematics Stack Exchange

discrete mathematics - Confusion from a textbook comment about induction - Mathematics Stack Exchange

Solved (9) (OPTIONAL) We want to place n rooks on an n x n

Mathematics_Magazine_75_5)Walter_Stromquist_(Editor_in_Chief).

Olympiad Combinatorics, PDF, Combinatorics

Tournament of towns senior

On partial information retrieval: the unconstrained 100 prisoner problem

PDF) $k$-Dependence and Domination in Kings Graphs

Uncategorized Archives - peterkagey

Programming Challenges

The Delta Epsilon, Issue 7 by The Delta Epsilon - Issuu