Some remarks on the theory of graphs
From MaRDI portal
Publication:5789964
DOI10.1090/S0002-9904-1947-08785-1zbMATH Open0032.19203OpenAlexW2045472305WikidataQ55969772 ScholiaQ55969772MaRDI QIDQ5789964FDOQ5789964
Publication date: 1947
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9904-1947-08785-1
Cited In (only showing first 100 items - show all)
- Two extensions of Ramsey's theorem
- Title not available (Why is that?)
- On a Ramsey type theorem
- Constructive lower bounds for off-diagonal Ramsey numbers
- Constructing Ramsey graphs from Boolean function representations
- Lower bounds for \(r_2(K_1 + G)\) and \(r_3(K_1 + G)\) from Paley graph and generalization
- Title not available (Why is that?)
- Lower bounds for Ramsey numbers of \(K_n\) with a small subgraph removed
- Lebesgue functions and Lebesgue constants in polynomial interpolation
- A Precise Threshold for Quasi-Ramsey Numbers
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- On nowhere dense graphs
- Ramsey's theorem and self-complementary graphs
- Title not available (Why is that?)
- Some Ramsey-type theorems
- Path-cycle Ramsey numbers
- Ultrafilter Mappings and Their Dedekind Cuts
- On a combinatorial game
- Intersection theorems with geometric consequences
- A NOTE ON ORDER‐TYPE HOMOGENEOUS POINT SETS
- Ramsey-type results for semi-algebraic relations
- On the minimum degree of minimal Ramsey graphs for multiple colours
- The Erdős-Hajnal conjecture. A survey
- Derandomizing restricted isometries via the Legendre symbol
- On homogeneous sets of positive integers
- Turán-type results for partial orders and intersection graphs of convex sets
- Generalized Ramsey theory for graphs. I: Diagonal numbers
- A note on propositional proof complexity of some Ramsey-type statements
- Off-diagonal hypergraph Ramsey numbers
- Randomly colouring graphs (a combinatorial view)
- Opposite power series
- Dense subgraphs in random graphs
- On a Problem in Graph Theory
- Regular pairs in sparse random graphs I
- The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
- On independent sets in random graphs
- Ramsey's theorem - a new lower bound
- On extremal problems of graphs and generalized graphs
- Asymptotic lower bounds for Ramsey functions
- Large unavoidable subtournaments
- Ramsey Goodness of Bounded Degree Trees
- On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
- On two problems in graph Ramsey theory
- Approximating hyper-rectangles: Learning and pseudorandom sets
- What is Ramsey-equivalent to a clique?
- Crossing patterns of semi-algebraic sets
- Ramsey Graphs and Block Designs. I
- Title not available (Why is that?)
- Induced Ramsey-type theorems
- Ramsey-type theorems
- On the structure of linear graphs
- On finite Ramsey numbers
- Hypergraph Ramsey numbers
- Ramsey-type theorems for sets satisfying a geometric regularity condition
- Ramsey goodness of paths
- Unavoidable subgraphs of colored graphs
- Unavoidable patterns
- CONVOLUTIONS OF RAMANUJAN SUMS AND INTEGRAL CIRCULANT GRAPHS
- Harnessing the Bethe free energy
- Graph Theory and Probability
- On the minimum order of graphs with given semigroup
- The Ramsey number of the clique and the hypercube
- RTNI—A symbolic integrator for Haar-random tensor networks
- The Ramsey numbers of paths versus wheels: a complete solution
- A conjecture of Erdős on graph Ramsey numbers
- Some remarks on Hajós' conjecture
- Minimum node covers and 2-bicritical graphs
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Calculating Ramsey Numbers by Partitioning Colored Graphs
- On the conjecture of Hajos
- Generalized and geometric Ramsey numbers for cycles.
- Ramsey numbers of connected clique matchings
- Ramsey properties of random hypergraphs
- Amount of nonconstructivity in deterministic finite automata
- Ramsey-goodness -- and otherwise
- An improved bound for the stepping-up lemma
- Edmonds polytopes and a hierarchy of combinatorial problems
- Partition relations for cardinal numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- A large number of \(m\)-coloured complete infinite subgraphs
- On the stability number of the edge intersection of two graphs.
- On the Profile of Multiplicities of Complete Subgraphs
- Pure pairs. II: Excluding all subdivisions of a graph
- The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime
- Proof of a conjecture on induced subgraphs of Ramsey graphs
- Ramsey numbers of cycles versus general graphs
- Probabilistic combinatorics and the recent work of Peter Keevash
- Gallai-Ramsey numbers for rainbow paths
- Turán theorems for unavoidable patterns
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Title not available (Why is that?)
- Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems
- Independent Deuber sets in graphs on the natural numbers
- Two remarks on graph norms
- Amount of Nonconstructivity in Finite Automata
- Graphs with Large Obstacle Numbers
- Phase transitions in discrete structures
Recommendations
This page was built for publication: Some remarks on the theory of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5789964)
