The following pages link to A course in combinatorics. (Q2755077):
Displaying 50 items.
- Eulerian and even-face ribbon graph minors (Q776268) (← links)
- Avoiding brooms, forks, and butterflies in the linear lattices (Q781522) (← links)
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs (Q819766) (← links)
- Correlations between the ranks of submatrices and weights of random codes (Q841241) (← links)
- Secure overlay network design (Q848639) (← links)
- Large sets of \(t\)-designs through partitionable sets: a survey (Q856838) (← links)
- The generalized Füredi conjecture holds for finite linear lattices (Q856864) (← links)
- A number-theoretic approach to homotopy exponents of \(\text{SU}(n)\) (Q863894) (← links)
- Combinatorial enumeration of \(2\times 2\) ribbon patterns (Q875065) (← links)
- Brunn--Minkowski inequalities for contingency tables and integer flows (Q876322) (← links)
- Combinatorial aspects of Parker's model (Q888282) (← links)
- Modular adjacency algebras of dual polar schemes (Q891543) (← links)
- On a symmetric representation of Hermitian matrices and its applications to graph theory (Q896012) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- On a quasi-ordering on Boolean functions (Q924135) (← links)
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)
- Difference set constructions of DRADs and association schemes (Q965235) (← links)
- An improved combinatorial approach for pricing Parisian options (Q965783) (← links)
- The discrepancy of the lex-least de Bruijn sequence (Q966010) (← links)
- Counting elements and geodesics in Thompson's group \(F\). (Q984996) (← links)
- Amorphic association schemes with negative Latin square-type graphs (Q998651) (← links)
- Construction of a superimposed code using partitions (Q1000098) (← links)
- New negative Latin square type partial difference sets in nonelementary Abelian 2-groups and 3-groups (Q1008991) (← links)
- Commutativity of the adjacency matrices of graphs (Q1011500) (← links)
- On set systems with restricted intersections modulo \(p\) and \(p\)-ary \(t\)-designs (Q1011503) (← links)
- Strongly regular tri-Cayley graphs (Q1024274) (← links)
- A combinatorial construction of the Gray map over Galois rings (Q1025970) (← links)
- Commutative association schemes (Q1039424) (← links)
- Optimization, block designs and no free lunch theorems (Q1041724) (← links)
- On Beck's coloring of posets (Q1043992) (← links)
- Block designs with near-minimal number of blocks (Q1045950) (← links)
- Large regular simplices contained in a hypercube (Q1046759) (← links)
- The card game SET. (Q1411672) (← links)
- A short proof of a theorem of Falmagne. (Q1431817) (← links)
- An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243) (← links)
- The super-connectivity of Kneser graphs (Q1630915) (← links)
- Hermitian rank distance codes (Q1647560) (← links)
- Indirect reciprocity with optional interactions and private information (Q1651817) (← links)
- On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture (Q1658759) (← links)
- Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer (Q1679226) (← links)
- Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\) (Q1680880) (← links)
- The equivalent representation of the breadth-one \(D\)-invariant polynomial subspace and its discretization (Q1691954) (← links)
- Weight distribution of rank-metric codes (Q1692146) (← links)
- The asymmetry number of finite tournaments, and some related results (Q1696527) (← links)
- Pure Weierstrass gaps from a quotient of the Hermitian curve (Q1696759) (← links)
- Triangular random matrices and biorthogonal ensembles (Q1698245) (← links)
- Minimum rectilinear Steiner tree of \(n\) points in the unit square (Q1699296) (← links)
- Shuffles of trees (Q1750210) (← links)
- On the number of Sudoku squares (Q1783641) (← links)
- Note on the spectral characterization of some cubic graphs with maximum number of triangles (Q1931749) (← links)
