Explicit Ramsey graphs and orthonormal labelings

From MaRDI portal
Publication:1346731

zbMath0814.05056MaRDI QIDQ1346731

Noga Alon

Publication date: 6 April 1995

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/118590



Related Items

Embedding graphs with bounded degree in sparse pseudorandom graphs, A clique-free pseudorandom subgraph of the pseudo polarity graph, On the Extremal Number of Subdivisions, Constructive bounds for a Ramsey-type problem, Approximating the independence number via the \(\vartheta\)-function, Turán's theorem for pseudo-random graphs, Some recent results on Ramsey-type numbers, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, Turán numbers of bipartite graphs plus an odd cycle, Dynamic concentration of the triangle‐free process, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error, Making an H $H$‐free graph k $k$‐colorable, The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘), Maximum cuts and judicious partitions in graphs without short cycles, Undecidability of polynomial inequalities in weighted graph homomorphism densities, New results for MaxCut in H$H$‐free graphs, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, A note on pseudorandom Ramsey graphs, Unnamed Item, Tuza's Conjecture is Asymptotically Tight for Dense Graphs, A Sequence of Triangle-Free Pseudorandom Graphs, Orthonormal representations of \(H\)-free graphs, Extremal results in sparse pseudorandom graphs, A construction for clique-free pseudorandom graphs, Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz, Lovász, Vectors, Graphs and Codes, Extremal results for odd cycles in sparse pseudorandom graphs, Some structural properties of low-rank matrices related to computational complexity, Quadratic forms on graphs, Near-perfect clique-factors in sparse pseudorandom graphs, Dense induced bipartite subgraphs in triangle-free graphs, Constructive lower bounds for off-diagonal Ramsey numbers, Some constructive bounds on Ramsey numbers, Some remarks on Hajós' conjecture, Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring, Near-perfect clique-factors in sparse pseudorandom graphs, Regular Turán numbers of complete bipartite graphs, Multicolor Ramsey numbers via pseudorandom graphs, Triangle‐factors in pseudorandom graphs, The triangle-free process, Approximating hyper-rectangles: Learning and pseudorandom sets, Clique-factors in sparse pseudorandom graphs, Bipartite subgraphs, On Some Open Questions for Ramsey and Folkman Numbers, Hasse diagrams with large chromatic number, Graph imperfection. II, Approximately strongly regular graphs