Exact Ramsey numbers in multipartite graphs arising from Hadamard matrices and strongly regular graphs
From MaRDI portal
Publication:2319701
DOI10.1016/j.disc.2019.04.023zbMath1418.05095OpenAlexW2944830143WikidataQ127848013 ScholiaQ127848013MaRDI QIDQ2319701
Emerson L. Monte Carmelo, Pablo H. Perondi
Publication date: 20 August 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.04.023
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items
Cites Work
- New lower bounds for Ramsey numbers of graphs and hypergraphs
- Mono-multi bipartite Ramsey numbers, designs, and matrices
- Strongly regular graphs and finite Ramsey theory
- On multicolor Ramsey numbers for complete bipartite graphs
- Ramsey graphs and block designs
- Bounds on Ramsey numbers of certain complete bipartite graphs
- Set and size multipartite Ramsey numbers for stars
- Some geometric structures and bounds for Ramsey numbers
- Ramsey numbers in complete balanced multipartite graphs. I: Set numbers
- Generalised Ramsey numbers for small graphs
- New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)
- Combinatorics. Room squares, sum-free sets, Hadamard matrices
- Generalized Ramsey theory for graphs. I: Diagonal numbers
- Multicolored set multipartite Ramsey numbers
- Tripartite Ramsey numbers for paths
- Ramsey Graphs and Block Designs. I
- Off‐diagonal and asymptotic results on the Ramsey number r(K2,m,K2,n)
- Size multipartite Ramsey numbers for stripes versus small cycles
- Symmetric Bush-type Hadamard matrices of order $4m^4$ exist for all odd $m$
- On Finite Polarized Partition Relations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
