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)
- 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
- 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
- Packing nearly optimal Ramsey \(R(3,t)\) graphs
- Suitable sets of permutations, packings of triples, and Ramsey's theorem
- Title not available (Why is that?)
- Lower bounds for multicolor Ramsey numbers
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems
- Lower bounds for hypergraph Ramsey numbers
- A note on lower bounds for induced Ramsey numbers
- Erdős–Hajnal for graphs with no 5‐hole
- Two problems in graph Ramsey theory
- Chromatic numbers of layered graphs with a bounded maximal clique
- On the asymptotic behavior of the independence number of a random \((n,n)\)-tree
- Non-bipartite \(k\)-common graphs
- The Erdős-Hajnal hypergraph Ramsey problem
- For most graphs H , most H -free graphs have a linear homogeneous set
- SLOW P-POINT ULTRAFILTERS
- Explicit two-source extractors and resilient functions
- On the amount of nonconstructivity in learning formal languages from text
- Excluding hooks and their complements
- A note on graphs and rational balls
- An upper bound for the restricted online Ramsey number
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime
- Title not available (Why is that?)
- The complexity of proving that a graph is Ramsey
- Off-diagonal book Ramsey numbers
- Title not available (Why is that?)
- On the Amount of Nonconstructivity in Learning Recursive Functions
- Title not available (Why is that?)
- Diagonal Ramsey via effective quasirandomness
- The Erdős-Hajnal conjecture for three colors and triangles
- Sketchy tweets: ten minute conjectures in graph theory
- A note on multicolor Ramsey number of small odd cycles versus a large clique
- Decompositions of partially ordered sets into chains and antichains of given size
- Probabilistic methods
- Proof of a conjecture on induced subgraphs of Ramsey graphs
- Distinct degrees and homogeneous sets
- Decomposition of Random Graphs into Complete Bipartite Graphs
- Large almost monochromatic subsets in hypergraphs
- Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
- On the maximum small-world subgraph problem
- Ramsey numbers and monotone colorings
- The Erdős-Hajnal conjecture for rainbow triangles
- On the number of zero-patterns of a sequence of polynomials
- Ramsey properties of algebraic graphs and hypergraphs
- Variance of the subgraph count for sparse Erdős-Rényi graphs
- An improved lower bound on multicolor Ramsey numbers
- Ramsey numbers of semi-algebraic and semi-linear hypergraphs
- Upper bounds on positional Paris-Harrington games
- Lower bounds for some Ramsey numbers
- On the multicolor Ramsey number of a graph with \(m\) edges
- A Ramsey-type result for geometric \(\ell\)-hypergraphs
- On Harrington's partition relation
- Non-Ramsey graphs are \(c\log n\)-universal
- Induced subgraphs of Ramsey graphs with many distinct degrees
- On group partitions associated with lower bounds for symmetric Ramsey numbers
- Ramsey Problems for Berge Hypergraphs
- Probabilistic methods in coloring and decomposition problems
- Erdős and Rényi conjecture
- Minimal Ramsey Graphs with Many Vertices of Small Degree
- Triangular Ramsey Numbers
- On Erdős-Rado numbers
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- Blowup Ramsey numbers
- Perfect graph decompositions
- The Ramsey numbers r(P\(_m\),K\(_n\))
- Lower bounds for some Ramsey numbers
- Large cliques and independent sets all over the place
- Distinct degrees in induced subgraphs
- Lower bounds for bi-colored quaternary Ramsey numbers
- Ramsey numbers of ordered graphs
- Searching and inferring colorful topological motifs in vertex-colored graphs
- On the typical case complexity of graph optimization
- On the number of homogeneous subgraphs of a graph
- Induced Subgraphs With Many Distinct Degrees
- A Ramsey‐type problem and the Turán numbers*
- In memory of Tibor Gallai
- Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
- Induced Ramsey-type theorems
- Unordered canonical Ramsey numbers
- Ramsey graphs contain many distinct induced subgraphs
- On families in finite lattices
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)
