Essentially tight bounds for rainbow cycles in proper edge-colourings
From MaRDI portal
Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Expander graphs (05C48) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Additive bases, including sumsets (11B13) Coding theorems (Shannon theory) (94A24)
Cites work
- A polynomial bound in Freiman's theorem.
- A proof of Mader's conjecture on large clique subdivisions in \(C_4\)-free graphs
- A quantitative version of the Beurling-Helson theorem
- A solution to Erdős and Hajnal’s odd cycle problem
- Additive dimension and a theorem of Sanders
- Aldous's spectral gap conjecture for normal sets
- Approximate multiplicative groups in nilpotent Lie groups
- Approximate subgroups of linear groups.
- Arithmetical interpretation of weighted Davenport constants.
- Better lower and upper bounds for the minimum rainbow subgraph problem
- Clique immersion in graphs without a fixed bipartite graph
- Crux and Long Cycles in Graphs
- Decomposing a graph into expanding subgraphs
- Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3
- Embedding rainbow trees with applications to graph labelling and decomposition
- Extremal density for sparse minors and subdivisions
- Freiman's theorem in an arbitrary abelian group
- Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\).
- Growth in \(\mathrm{SL}_3(\mathbb Z/p\mathbb Z)\).
- Growth in finite simple groups of Lie type
- Growth in solvable subgroups of \(\mathrm{GL}_r(\mathbb Z/p\mathbb Z)\).
- How Many Points Can Be Reconstructed from k Projections?
- How to build a pillar: a proof of Thomassen's conjecture
- scientific article; zbMATH DE number 3937197 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 1787227 (Why is no real title available?)
- scientific article; zbMATH DE number 3189017 (Why is no real title available?)
- scientific article; zbMATH DE number 46730 (Why is no real title available?)
- Immersion of complete digraphs in Eulerian digraphs
- Logarithmically small minors and topological minors
- Nested cycles with no geometric crossings
- New bounds for Ryser’s conjecture and related problems
- New bounds on cap sets
- On a theorem of Shkredov
- On Roth's theorem on progressions
- On subgraphs of random Cayley sum graphs
- On the size of dissociated bases
- On the Turán number of the hypercube
- On triples in arithmetic progression
- On weighted zero-sum sequences
- Plus-minus weighted zero-sum constants: a survey
- Product set estimates for non-commutative groups
- Proof of Aldous' spectral gap conjecture
- Proof of Komlós's conjecture on Hamiltonian subsets
- Rainbow clique subdivisions
- Rainbow cycles in properly edge-colored graphs
- Rainbow Turán number of clique subdivisions
- Rainbow Turán problem for even cycles
- Rainbow Turán Problems
- Ramsey numbers of cycles versus general graphs
- Regular subgraphs of linear hypergraphs
- Remarks on the plus-minus weighted Davenport constant
- Robust (rainbow) subdivisions and simplicial cycles
- Roth's theorem on progressions revisited
- Separating path systems of almost linear size
- Sets with large additive energy and symmetric sets
- Small complete minors above the extremal edge density
- Structure in sets with logarithmic doubling
- The extremal number of surfaces
- The Extremal Number of Tight Cycles
- The number of unit distances is almost linear for most norms
- The probabilistic method
- The structure theory of set addition revisited
- Topological cliques in graphs II
- Towards the Erdős-Gallai cycle decomposition conjecture
- Unit and distinct distances in typical norms
- Well-mixing vertices and almost expanders
This page was built for publication: Essentially tight bounds for rainbow cycles in proper edge-colourings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993287)
