The Ramsey number R(3, t) has order of magnitude t2/log t
From MaRDI portal
Publication:4851927
DOI10.1002/rsa.3240070302zbMath0832.05084MaRDI QIDQ4851927
Publication date: 8 February 1996
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240070302
Related Items
Coloring graphs with fixed genus and girth, Concentration of non‐Lipschitz functions and applications, Turán and Ramsey Properties of Subcube Intersection Graphs, Large chromatic number and Ramsey graphs, An improved bound for the stepping-up lemma, Some recent results on Ramsey-type numbers, A stability theorem on fractional covering of triangles by edges, Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions, Ramsey numbers of \(K_3\) and \(K_{n,n}\), Independent sets and matchings in subcubic graphs, Independent dominating sets in triangle-free graphs, Some remarks on vertex Folkman numbers for hypergraphs, On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs, Claw-free graphs. VI: Colouring, Ramsey numbers of some bipartite graphs versus complete graphs, Some remarks on Hajós' conjecture, The chromatic gap and its extremes, Ramsey numbers involving graphs with large degrees, Bounds on some van der Waerden numbers, Triangle-free graphs whose independence number equals the degree, Gallai colorings of non-complete graphs, Some constructive bounds on Ramsey numbers, The early evolution of the \(H\)-free process, Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs, The triangle-free process, Partitioning graphs into complete and empty graphs, Near-optimal, distributed edge colouring via the nibble method, Fractional v. integral covers in hypergraphs of bounded edge size, Nearly perfect matchings in regular simple hypergraphs, A few remarks on Ramsey--Turán-type problems, Ramsey numbers involving large dense graphs and bipartite Turán numbers, Independence numbers of hypergraphs with sparse neighborhoods., Triangle-free graphs and forbidden subgraphs, Graph imperfection. II, On graphs with a large chromatic number that contain no small odd cycles, Hall ratio of the Mycielski graphs, Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture, Almost all graphs with high girth and suitable density have high chromatic number, Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs, The Final Size of theC4-Free Process, Hypergraph Ramsey numbers
Cites Work
- Unnamed Item
- Asymptotic behavior of the chromatic index for hypergraphs
- A note on the independence number of triangle-free graphs
- On a packing and covering problem
- Near perfect coverings in graphs and hypergraphs
- A dense infinite Sidon sequence
- A note on the independence number of triangle-free graphs. II
- Random matchings in regular graphs
- Asymptotically good list-colorings
- Weighted sums of certain dependent random variables
- Graph Theory and Probability. II
- A Lower Bound for Heilbronn'S Problem
- On Brooks' Theorem for Sparse Graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Some graph theoretic results associated with Ramsey's theorem
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
