Combinatorics. Abstracts from the workshop held January 1--7, 2023
From MaRDI portal
Publication:6052106
DOI10.4171/owr/2023/1zbMath1525.00023OpenAlexW4387395184MaRDI QIDQ6052106
No author found.
Publication date: 23 October 2023
Published in: Oberwolfach Reports (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/owr/2023/1
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Collections of abstracts of lectures (00B05)
Cites Work
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture
- How many colors guarantee a rainbow matching?
- Nontrivial \(t\)-designs over finite fields exist for all \(t\)
- Multicolored matchings in hypergraphs
- Hamilton cycles in dense vertex-transitive graphs
- On generalized Ramsey numbers of Erdős and Rogers
- On the Erdős distinct distances problem in the plane
- Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited
- Combinatorics and complexity of partition functions
- Measurable circle squaring
- The rank of diluted random graphs
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- The number of unit distances is almost linear for most norms
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- Ramsey-type theorems
- A nowhere-zero point in linear mappings
- On linear k-arboricity
- Supersaturated graphs and hypergraphs
- Random symmetric matrices are almost surely nonsingular.
- Coverings of Abelian groups and vector spaces.
- The roots of the independence polynomial of a clawfree graph
- Induced subgraphs of Ramsey graphs with many distinct degrees
- Near optimal bounds for the Erdős distinct distances problem in high dimensions
- Finite size scaling for the core of large random hypergraphs
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
- Noise stability of functions with low influences: invariance and optimality
- The early evolution of the \(H\)-free process
- Triangulations. Structures for algorithms and applications
- Hamiltonian paths in Cayley graphs
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Sidon sets in groups and induced subgraphs of Cayley graphs
- On universality of graphs with uniformly distributed edges
- The linear arboricity of graphs
- A note on Ramsey numbers
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Circle-squaring in the twentieth century
- Additive bases of vector spaces over prime fields
- On the second eigenvalue of a graph
- Covering the cube by affine hyperplanes
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Transversals of latin squares and their generalizations
- Hamiltonian circuits in random graphs
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Inequalities in Fourier analysis
- An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
- Asymptotic lower bounds for Ramsey functions
- Another bound on the chromatic number of a graph
- Maximal sets of Latin squares and partial transversals
- Erdős and Rényi conjecture
- Transversals in row-latin rectangles
- A strengthening of Brooks' theorem
- Call routing and the ratcatcher
- On the ascending star subgraphs decomposition of star forests
- Explicit Ramsey graphs and orthonormal labelings
- On the linear \(k\)-arboricity of cubic graphs
- Some recent problems and results in graph theory
- Constructive bounds for a Ramsey-type problem
- Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
- Flipping edge-labelled triangulations
- Counting designs
- (\(\Delta-k\))-critical graphs
- The polytope of non-crossing graphs on a planar point set
- Flipping edges in triangulations
- Non-Ramsey graphs are \(c\log n\)-universal
- Lower bounds for small diagonal Ramsey numbers
- q-analogues of t-designs and their existence
- Two solutions to diluted \(p\)-spin models and XORSAT problems
- The number of 2-SAT functions
- Tight estimates for eigenvalues of regular graphs
- Multiplicities of subgraphs
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- The number of 3-SAT functions
- A combinatorial problem on polynomials and rational functions
- Thresholds versus fractional expectation-thresholds
- Towards the linear arboricity conjecture
- Long cycles, heavy cycles and cycle decompositions in digraphs
- Flattening rank and its combinatorial applications
- Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
- Improved bounds for the sunflower lemma
- Measurable equidecompositions for group actions with an expansion property
- Connectivity of triangulation flip graphs in the plane
- How to find groups?
- Towards Erdős-Hajnal for graphs with no 5-hole
- Singularity of random Bernoulli matrices
- Rainbow fractional matchings
- Constructions for the Elekes-Szabó and Elekes-Rónyai problems
- Computing permanents of complex diagonally dominant matrices and tensors
- Hypergraph Ramsey numbers: triangles versus cliques
- A correlation inequality for bipartite graphs
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- Probabilistic existence of regular combinatorial structures
- Borel circle squaring
- Extremal cuts of sparse random graphs
- A proof of the orbit conjecture for flipping edge-labelled triangulations
- Ramsey graphs induce subgraphs of many different sizes
- Suboptimality of local algorithms for a class of max-cut problems
- Large rainbow matchings in general graphs
- Almost every 2-SAT function is unate
- Sharp bounds for some multicolour Ramsey numbers
- Additive patterns in multiplicative subgroups
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- Theory of monomer-dimer systems
- A note on Hamiltonian circuits
- On a Ramsey type theorem
- Transforming triangulations
- The module structure of integral designs
- Random regular graphs of high degree
- A Note on Vertex List Colouring
- Polynomials vanishing on grids: The Elekes-Rónyai problem revisited
- Product mixing in the alternating group
- The Erdös-Hajnal Conjecture-A Survey
- Random Latin square graphs
- Non-Three-Colourable Common Graphs Exist
- Graphs with $\chi=\Delta$ Have Big Cliques
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- Long cycles in vertex-transitive graphs
- On the Rank of Random Sparse Matrices
- Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
- Research Problems in Discrete Geometry
- Recent developments in graph Ramsey theory
- Hitting Time Theorems for Random Matrices
- On Sets of Acquaintances and Strangers at any Party
- Distinct degrees in induced subgraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Edge Distribution of Graphs with Few Copies of a Given Graph
- Rainbow Turán Problems
- A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω
- Uniform generation of random regular graphs of moderate degree
- Bounding χ in terms of ω and Δ for quasi-line graphs
- The rank of random graphs
- A Note On Reed's Conjecture
- Groups covered by finitely many cosets or subgroups
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- Cutting a graph into two dissimilar halves
- On the Ramsey multiplicities of graphs—problems and recent results
- Uniformly Spread Discrete Sets in R d
- Decomposition of Sets with Small Boundary
- On the Chromatic Number of Subgraphs of a Given Graph
- Random Cayley graphs and expanders
- On Subgraph Sizes in Random Graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Induced subgraphs of prescribed size
- On the max‐cut of sparse random graphs
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- On the K‐sat model with large number of clauses
- Equidecomposability and discrepancy; a solution of Tarski's circle-squaring problem
- Sparse pseudo‐random graphs are Hamiltonian
- The number of k‐SAT functions
- Almost all Cayley graphs are hamiltonian
- Optimization on sparse random hypergraphs and spin glasses
- Decompositions into spanning rainbow structures
- Uniform Generation of Random Regular Graphs
- New bounds for Ryser’s conjecture and related problems
- Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes
- MEASURABLE EQUIDECOMPOSITIONS
- The rank of sparse random matrices
- Hitting all maximum cliques with a stable set using lopsided independent transversals
- Approximating real-rooted and stable polynomials, with combinatorial applications
- The Gram-Schmidt walk: a cure for the Banaszczyk blues
- Proof of a conjecture on induced subgraphs of Ramsey graphs
- A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs
- Coloring Claw-Free Graphs with $\Delta-1$ Colors
- A Sequence of Triangle-Free Pseudorandom Graphs
- Invertibility of symmetric random matrices
- Dynamic concentration of the triangle-free process
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- A generalization of Turán's theorem
- List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
- A lower bound for the order of a partial transversal in a latin square
- Some remarks on the theory of graphs
- Some Theorems on Abstract Graphs
- On Sets of Distances of n Points
- Irregularity in Graphs
- (Dis)assortative partitions on random regular graphs
- Singularity of sparse random matrices: simple proofs
- On tripartite common graphs
- Induced Ramsey-type theorems
- A lower bound for the length of a partial transversal in a Latin square
- A lower bound for the length of a partial transversal in a Latin square
- A local epsilon version of Reed's conjecture
- A note on odd cycle-complete graph Ramsey numbers
- Ramsey-type theorems with forbidden subgraphs
- Friendly bisections of random graphs
- Fast uniform generation of random graphs with given degree sequences
- Erdős–Hajnal for graphs with no 5‐hole
- Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics
- Common graphs with arbitrary connectivity and chromatic number
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Combinatorics. Abstracts from the workshop held January 1--7, 2023
