The number of submatrices of a given type in a Hadamard matrix and related results

DOI10.1016/0095-8956(88)90040-8zbMath0658.05015OpenAlexW2035687898WikidataQ105583547 ScholiaQ105583547MaRDI QIDQ1111555

Vojtěch Rödl, Peter Frankl, Richard M. Wilson

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90040-8

zbMATH Keywords

submatrixgraphs with uniformly distributed edges

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items

Quasi‐random classes of hypergraphs, Embedding graphs with bounded degree in sparse pseudorandom graphs, On characterizing hypergraph regularity, Quasi-Random Set Systems, Quasi-random multilinear polynomials, The minimum independence number for designs, Ultimate data hiding in quantum mechanics and beyond, FORCING QUASIRANDOMNESS WITH TRIANGLES, Quasi-random graphs, Quasi-random subsets of \(\mathbb{Z}_ n\), 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs, Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs, Regular pairs in sparse random graphs I, Quasirandomness in hypergraphs, A Ramsey type problem concerning vertex colourings, Not all graphs are segment \(T\)-graphs, Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs, Discrepancy and eigenvalues of Cayley graphs

Cites Work

• Unnamed Item
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• On universality of graphs with uniformly distributed edges
• Graphs which contain all small graphs
• A Constructive Solution to a Tournament Problem