Some remarks on the theory of graphs
From MaRDI portal
Publication:5789964
DOI10.1090/S0002-9904-1947-08785-1zbMath0032.19203OpenAlexW2045472305WikidataQ55969772 ScholiaQ55969772MaRDI QIDQ5789964
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
Related Items
Lebesgue functions and Lebesgue constants in polynomial interpolation, On homogeneous sets of positive integers, A note on multicolor Ramsey number of small odd cycles versus a large clique, Phase transitions in discrete structures, On the minimum degree of minimal Ramsey graphs for multiple colours, Derandomizing restricted isometries via the Legendre symbol, Probabilistic methods, On ordered Ramsey numbers of bounded-degree graphs, Two problems in graph Ramsey theory, Lower bounds for hypergraph Ramsey numbers, Large unavoidable subtournaments, The proof-theoretic strength of Ramsey's theorem for pairs and two colors, Non-bipartite \(k\)-common graphs, Ramsey-type theorems for sets satisfying a geometric regularity condition, Ramsey goodness of paths, On extremal problems of graphs and generalized graphs, Off-diagonal hypergraph Ramsey numbers, On the asymptotic behavior of the independence number of a random \((n,n)\)-tree, Decompositions of partially ordered sets into chains and antichains of given size, Excluding hooks and their complements, Ramsey properties of random hypergraphs, On two problems in graph Ramsey theory, The Erdős-Hajnal hypergraph Ramsey problem, Turán-type results for partial orders and intersection graphs of convex sets, An improved bound for the stepping-up lemma, Packing nearly optimal Ramsey \(R(3,t)\) graphs, Induced subgraphs of Ramsey graphs with many distinct degrees, Two extensions of Ramsey's theorem, On Berge-Ramsey problems, Constructing Ramsey graphs from Boolean function representations, The Ramsey numbers r(P\(_m\),K\(_n\)), Lower bounds for \(r_2(K_1 + G)\) and \(r_3(K_1 + G)\) from Paley graph and generalization, Gallai-Ramsey numbers for rainbow paths, Semi-algebraic Ramsey numbers, Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane, A note on propositional proof complexity of some Ramsey-type statements, On Harrington's partition relation, The complexity of proving that a graph is Ramsey, Lower bounds for Ramsey numbers of \(K_n\) with a small subgraph removed, Lower bounds for bi-colored quaternary Ramsey numbers, Opposite power series, Ramsey numbers and monotone colorings, On group partitions associated with lower bounds for symmetric Ramsey numbers, Exact Ramsey numbers of odd cycles via nonlinear optimisation, Amount of nonconstructivity in deterministic finite automata, Randomly colouring graphs (a combinatorial view), What is Ramsey-equivalent to a clique?, Lower bounds for multicolor Ramsey numbers, Intersection theorems with geometric consequences, On finite Ramsey numbers, Upper bounds on positional Paris-Harrington games, Some Ramsey-type theorems, Perfect graph decompositions, Blowup Ramsey numbers, The Ramsey numbers of paths versus wheels: a complete solution, Unavoidable subgraphs of colored graphs, Dense subgraphs in random graphs, A large number of \(m\)-coloured complete infinite subgraphs, Ramsey numbers of connected clique matchings, Excluding paths and antipaths, Unavoidable patterns, In memory of Tibor Gallai, A conjecture of Erdős on graph Ramsey numbers, Large almost monochromatic subsets in hypergraphs, Chromatic numbers of layered graphs with a bounded maximal clique, Variance of the subgraph count for sparse Erdős-Rényi graphs, Ramsey-goodness -- and otherwise, The Erdős-Hajnal conjecture for rainbow triangles, Path-cycle Ramsey numbers, Ramsey's theorem - a new lower bound, Suitable sets of permutations, packings of triples, and Ramsey's theorem, Path-path Ramsey type numbers for the complete bipartite graph, Some remarks on Hajós' conjecture, Ramsey numbers for triples, Asymptotic lower bounds for Ramsey functions, On the multicolor Ramsey number of a graph with \(m\) edges, Pure pairs. II: Excluding all subdivisions of a graph, A Ramsey-type result for geometric \(\ell\)-hypergraphs, On the amount of nonconstructivity in learning formal languages from text, Pseudo-random hypergraphs, Ramsey-type theorems, Erdős and Rényi conjecture, Non-Ramsey graphs are \(c\log n\)-universal, On the number of homogeneous subgraphs of a graph, An upper bound for the restricted online Ramsey number, Approximating hyper-rectangles: Learning and pseudorandom sets, Explicit two-source extractors and resilient functions, On the conjecture of Hajos, On the maximum small-world subgraph problem, Searching and inferring colorful topological motifs in vertex-colored graphs, Weak measure extension axioms, On Erdős-Rado numbers, There is no fast method for finding monochromatic complete subgraphs, On the minimum order of graphs with given semigroup, Unordered canonical Ramsey numbers, On the stability number of the edge intersection of two graphs., Ramsey graphs contain many distinct induced subgraphs, On families in finite lattices, The Erdős-Hajnal conjecture for three colors and triangles, Probabilistic methods in coloring and decomposition problems, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Erdős–Hajnal for graphs with no 5‐hole, A bipartite version of the Erdős–McKay conjecture, Off-diagonal book Ramsey numbers, Composing and decomposing surfaces and functions, On quantitative aspects of a canonisation theorem for edge‐orderings, Ramsey properties of semilinear graphs, String graphs have the Erdős-Hajnal property, Ramsey numbers with prescribed rate of growth, Ramsey numbers of cliques versus monotone paths, On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles, Ramsey properties of algebraic graphs and hypergraphs, CONVOLUTIONS OF RAMANUJAN SUMS AND INTEGRAL CIRCULANT GRAPHS, Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems, On the structure of linear graphs, A Ramsey‐type problem and the Turán numbers*, From Affine to Two-Source Extractors via Approximate Duality, On independent sets in random graphs, Probabilistic combinatorics and the recent work of Peter Keevash, Unnamed Item, Turán theorems for unavoidable patterns, Ramsey-type results for semi-algebraic relations, A NOTE ON ORDER‐TYPE HOMOGENEOUS POINT SETS, SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY, An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy, For most graphs H , most H -free graphs have a linear homogeneous set, A note on the Erdős-Hajnal hypergraph Ramsey problem, Minimal Ramsey Graphs with Many Vertices of Small Degree, A Precise Threshold for Quasi-Ramsey Numbers, Erdős-Hajnal conjecture for graphs with bounded VC-dimension, A note on lower bounds for induced Ramsey numbers, Generalized Ramsey theory for graphs, RIGOUR AND PROOF, Diagonal Ramsey via effective quasirandomness, The minimum degree of minimal Ramsey graphs for cliques, Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture, Ramsey numbers of semi-algebraic and semi-linear hypergraphs, Harnessing the Bethe free energy, Distinct degrees and homogeneous sets, SLOW P-POINT ULTRAFILTERS, The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘), Unnamed Item, Induced Subgraphs With Many Distinct Degrees, Sketchy tweets: ten minute conjectures in graph theory, On nowhere dense graphs, Unnamed Item, Large Unavoidable Subtournaments, Calculating Ramsey Numbers by Partitioning Colored Graphs, Arithmetic Progressions and Tic-Tac-Toe Games, Ramsey Goodness of Cycles, Ramsey numbers of ordered graphs, Ordered Ramsey numbers, Unnamed Item, On the number of zero-patterns of a sequence of polynomials, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Distinct degrees in induced subgraphs, The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, Ramsey Goodness of Bounded Degree Trees, RAMSEY GROWTH IN SOME NIP STRUCTURES, Exploiting c-Closure in Kernelization Algorithms for Graph Problems, On the Amount of Nonconstructivity in Learning Recursive Functions, Unnamed Item, Ramsey numbers of ordered graphs, Induced Ramsey-type theorems, Induced Ramsey-type theorems, On a combinatorial game, Constructive lower bounds for off-diagonal Ramsey numbers, Hypergraph Ramsey numbers, Decomposition of Random Graphs into Complete Bipartite Graphs, Generalized and geometric Ramsey numbers for cycles., Lower bounds for some Ramsey numbers, Lower bounds for some Ramsey numbers, Minimum node covers and 2-bicritical graphs, Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint), Regular pairs in sparse random graphs I, Unnamed Item, Unnamed Item, Graphs with Large Obstacle Numbers, Triangular Ramsey Numbers, An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs, On the Profile of Multiplicities of Complete Subgraphs, The line analog of Ramsey numbers, Ramsey Problems for Berge Hypergraphs, Ultrafilter Mappings and Their Dedekind Cuts, Another analog of Ramsey numbers, Amount of Nonconstructivity in Finite Automata, Ramsey Graphs and Block Designs. I, Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes, The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, An improved lower bound on multicolor Ramsey numbers, On a Ramsey type theorem, Ramsey's theorem and self-complementary graphs, Edmonds polytopes and a hierarchy of combinatorial problems, Generalized Ramsey theory for graphs. I: Diagonal numbers, The Ramsey number of the clique and the hypercube, Proof of a conjecture on induced subgraphs of Ramsey graphs, Large cliques and independent sets all over the place, Unnamed Item, Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs, Crossing patterns of semi-algebraic sets, Fractional Chromatic Number, Maximum Degree, and Girth, On the typical case complexity of graph optimization, The Erdös-Hajnal Conjecture-A Survey, RTNI—A symbolic integrator for Haar-random tensor networks, On irregularities of integer sequences, On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs, Minimum Degrees of Minimal Ramsey Graphs for Almost‐Cliques, Partition relations for cardinal numbers, Ramsey numbers of cycles versus general graphs
