scientific article; zbMATH DE number 3711961
From MaRDI portal
Publication:3903002
arithmetic progressionEuclidean Ramsey theorygraph Ramsey theoryRamsey theoryregular homogeneous systemsultrafilters
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05) Combinatorial aspects of partitions of integers (05A17) Generalized Ramsey theory (05C55) Arithmetic progressions (11B25) Linear transformations, semilinear transformations (15A04) Cardinality properties (cardinal functions and inequalities, discrete subsets) (54A25)
Cited in
(only showing first 100 items - show all)- Some recollections on early work with Jan Pelant
- Some results on graphs without long induced paths
- A selection of open problems
- Fraternal augmentations, arrangeability and linear Ramsey numbers
- Dualities in full homomorphisms
- A quintessential proof of van der Waerden's theorem on arithmetic progressions
- A dual form of Ramsey's theorem
- Canonizing Ramsey theorems for finite graphs and hypergraphs
- Monochromatic affine lines in finite vector spaces
- Affine and combinatorial binary m-spaces
- Irrepresentability by multiple intersection, or why the interval number is unbounded
- Canonizing partition theorems: Diversification, products, and iterated versions
- Quantitative forms of a theorem of Hilbert
- Intersection theorems for vector spaces
- Canonizing ordering theorems for Hales Jewett structures
- On Ramsey-Turán type problems in tournaments
- Construction techniques for some thin sets in duals of compact abelian groups
- An elementary proof of the canonizing version of Gallai-Witt's theorem
- Partition properties of q-hypergraphs
- Ramsey properties for classes of relational systems
- Maximum induced trees in graphs
- Large minimal sets which force arithmetic progressions
- An ergodic Szemerédi theorem for IP-systems and combinatorial theory
- A density statement generalizing Schur's theorem
- Induced restricted Ramsey theorems for spaces
- Rings of geometries. I
- Subset sums
- What can we hope to accomplish in generalized Ramsey theory ?
- On the Cantor-Dedekind property of the Tilson order on categories and graphs
- Local k-colorings of graphs and hypergraphs
- Induced partition properties of combinatorial cubes
- Density versions of two generalizations of Schur's theorem
- Ramsey numbers based on \(C_ 5\)-decompositions
- Some equivalents of the Erdős sum of reciprocals conjecture
- Lower bound arguments with ``inaccessible numbers
- A lower bound for read-once-only branching programs
- Quantitative theorems for regular systems of equations
- Explicit construction of linear sized tolerant networks
- Partitions and sums of (m,p,c)-sets
- Some remarks on natural orders for combinatorial cubes
- Monochromatic sumsets
- Infinite combinatorics and definability
- A combinatorial interpretation of \((1/k!)\Delta ^ kt^ n\)
- On the dimension of the Hilbert cubes
- On the generalized Erdös-Szekeres conjecture -- a new upper bound
- On van der Waerden's theorem on arithmetic progressions
- On the Ramsey numbers R(3,8) and R(3,9)
- Graphs without large triangle free subgraphs
- Vertex coverings by monochromatic cycles and trees
- The Mapmaker's dilemma
- Independent sets in regular graphs and sum-free subsets of finite groups
- Analyzing Nash-Williams' partition theorem by means of ordinal types
- Fast growing functions based on Ramsey theorems
- Functorial admissible quasi-uniformities on topological spaces
- Ramsey functions related to the van der Waerden numbers
- Lipschitz functions on classical spaces
- Generalized local colorings of graphs
- Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets
- On Ramsey graphs without bipartite subgraphs
- A linear Ramsey theorem
- Intracommutativity properties for groups and semigroups
- Universal cycles for combinatorial structures
- On the Ramsey problem for multicolor bipartite graphs
- Split and balanced colorings of complete graphs
- A Boolean model of ultrafilters
- The existence of exactly m-coloured complete subgraphs
- An application of Ramsey's theory to partitions in groups. II
- An extension of Kleene's and Ochmański's theorems to infinite traces
- Note on a Ramsey-type problem in geometry
- Unbalanced Steiner triple systems
- Infinite words and biprefix codes
- A linear upper bound in extremal theory of sequences
- A few applications of negative-type inequalities
- Problems and results in discrete mathematics
- Towards the parallel repetition conjecture
- On bounds for size Ramsey numbers of a complete tripartite graph
- A Ramsey property of order types
- Ramsey-type theorems for spatial graphs and good drawings
- Independent dominating sets and a second hamiltonian cycle in regular graphs
- Factorizations of infinite sequences in semigroups
- Chromatic Ramsey numbers
- A projection property and Arrow's impossibility theorem
- Difference Ramsey numbers and Issai numbers
- New upper bound for multicolor Ramsey number of odd cycles
- \(>k\)-homogeneous infinite graphs
- Ideals in \(\mathcal{P}_G\) and \(\beta G\)
- Bipartite Ramsey numbers for graphs of small bandwidth
- Set mappings on 4-tuples
- Lexicographic Ramsey theory
- For graphs there are only four types of hereditary Ramsey classes
- The Hales-Jewett theorem and possible generalizations
- Not all graphs are segment \(T\)-graphs
- Iterated combinatorial density theorems
- On the finite containment problem for Petri nets
- The star arboricity of graphs
- Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets
- Two proofs of the Ramsey property of the class of finite hypergraphs
- Canonical configurations
- A structural property of regular frequency computations.
- A generalization of the Banach contraction principle
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3903002)
