Pages that link to "Item:Q1111555"
From MaRDI portal
The following pages link to The number of submatrices of a given type in a Hadamard matrix and related results (Q1111555):
Displayed 18 items.
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs (Q685676) (← links)
- Quasi-random subsets of \(\mathbb{Z}_ n\) (Q1194750) (← links)
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs (Q1205339) (← links)
- A Ramsey type problem concerning vertex colourings (Q1262327) (← links)
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs (Q1276304) (← links)
- Ultimate data hiding in quantum mechanics and beyond (Q1664325) (← links)
- Not all graphs are segment \(T\)-graphs (Q1813624) (← links)
- Embedding graphs with bounded degree in sparse pseudorandom graphs (Q1885587) (← links)
- The minimum independence number for designs (Q1894699) (← links)
- Quasi-random multilinear polynomials (Q2631886) (← links)
- Discrepancy and eigenvalues of Cayley graphs (Q2828826) (← links)
- Quasi‐random classes of hypergraphs (Q3970905) (← links)
- Regular pairs in sparse random graphs I (Q4419289) (← links)
- FORCING QUASIRANDOMNESS WITH TRIANGLES (Q4632525) (← links)
- Quasi-Random Set Systems (Q4713353) (← links)
- On characterizing hypergraph regularity (Q4798170) (← links)
- Quasi-random graphs (Q5895286) (← links)
- Quasirandomness in hypergraphs (Q5915722) (← links)