Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022

DOI10.4171/owr/2022/22zbMath1519.00024MaRDI QIDQ6170531

No author found.

Publication date: 10 August 2023

Published in: Oberwolfach Reports (Search for Journal in Brave)

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Proceedings, conferences, collections, etc. pertaining to probability theory (60-06) Collections of abstracts of lectures (00B05) Probability theory and stochastic processes (60-XX) Combinatorics (05-XX)

Cites Work

• On the number of matroids
• Twins in words and long common subsequences in permutations
• Crossing probabilities for Voronoi percolation
• Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
• Hamiltonicity, independence number, and pancyclicity
• Cycle spectra of Hamiltonian graphs
• Hypergraph containers
• Continuity of the phase transition for planar random-cluster and Potts models with \({1 \leq q \leq 4}\)
• Enumerating matroids of fixed rank
• Random matrices: tail bounds for gaps between eigenvalues
• Random matrices: universality of local eigenvalue statistics
• Triangle factors in sparse pseudo-random graphs
• Powers of Hamilton cycles in pseudorandom graphs
• Points and lines. Characterizing the classical geometries
• The self-dual point of the two-dimensional random-cluster model is critical for \(q \geqslant 1\)
• Local semicircle law and complete delocalization for Wigner random matrices
• Regularity of Gaussian processes
• On the distribution of the roots of certain symmetric matrices
• New sufficient conditions for cycles in graphs
• Solution of an extremal problem for sets using resultants of polynomials
• Random symmetric matrices are almost surely nonsingular.
• Hamiltonian degree conditions which imply a graph is pancyclic
• Pancyclicity of Hamiltonian and highly connected graphs
• The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
• On monochromatic solutions of equations in groups
• Reduction of the Hall-Paige conjecture to sporadic simple groups.
• On the singularity probability of discrete random matrices
• On a packing and covering problem
• An extremal problem for sets with applications to graph theory
• A cycle structure theorem for Hamiltonian graphs
• Hyperconnectivity of graphs
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• Donsker classes and random geometry
• Threshold functions
• On the combinatorial problems which I would most like to see solved
• An extremal problem for two families of sets
• A simple proof of the majorizing measure theorem
• Colorful induced subgraphs
• Matching and covering the vertices of a random graph by copies of a given graph
• Asymptotic growth of sparse saturated structures is locally determined
• Transversals of latin squares and their generalizations
• An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
• Maximal sets of Latin squares and partial transversals
• Some estimations useful in geometry of numbers
• The concentration of the chromatic number of random graphs
• Explicit Ramsey graphs and orthonormal labelings
• On Schur properties of random subsets of integers
• Large product-free subsets of finite groups
• Approximating the independence number via the \(\vartheta\)-function
• The asymptotic number of geometries
• On the number of monochromatic Schur triples.
• Boolean functions: influence, threshold and noise
• Counting designs
• Hypergraph saturation irregularities
• On the number of matroids on a finite set
• Asymptotic enumeration by degree sequence of graphs of high degree
• The number of 2-SAT functions
• Multiplicities of subgraphs
• The number of 3-SAT functions
• A regularity lemma and twins in words
• The number of monochromatic Schur triples
• Thresholds versus fractional expectation-thresholds
• On the singularity of random symmetric matrices
• Improved bounds for the sunflower lemma
• A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
• The feasible region of induced graphs
• Geometric and o-minimal Littlewood-Offord problems
• On the number of sets with a given doubling constant
• Towards a proof of the Fourier-entropy conjecture?
• Embedding rainbow trees with applications to graph labelling and decomposition
• On a conjecture of Erdős on locally sparse Steiner triple systems
• Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
• A proof of Ringel's conjecture
• Semicircle law on short scales and delocalization of eigenvectors for Wigner random matrices
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• Optimal packings of bounded degree trees
• The Hall-Paige conjecture, and synchronization for affine and diagonal groups
• Singularity of random Bernoulli matrices
• Packing degenerate graphs
• Spanning trees in random graphs
• Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
• On extremal problems of graphs and generalized graphs
• Almost every 2-SAT function is unate
• The Littlewood-Offord problem and invertibility of random matrices
• Selector processes on classes of sets
• The critical probability for random Voronoi percolation in the plane is 1/2
• The admissibility of sporadic simple groups.
• Pancyclic graphs. I
• On Hamilton's ideals
• An upper bound for the number of matroids
• The generalised Oberwolfach problem
• An asymptotic for the Hall-Paige conjecture
• Asymptotics for Shamir's problem
• Product mixing in the alternating group
• Fixed Energy Universality for Generalized Wigner Matrices
• An upper bound on the number of Steiner triple systems
• Are many small sets explicitly small?
• Extremal problems for cycles in graphs
• Ramsey multiplicity of linear patterns in certain finite abelian groups
• Counting sumsets and sum-free sets modulo a prime
• The number of sumsets in a finite field
• On Sets of Acquaintances and Strangers at any Party
• Polynomial Codes Over Certain Finite Fields
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• On random ±1 matrices: Singularity and determinant
• Path and cycle decompositions of dense graphs
• Almost all Steiner triple systems have perfect matchings
• On the singularity probability of random Bernoulli matrices
• Thresholds and Expectation Thresholds
• Factors in random graphs
• On two Combinatorial Problems Arising from Automata Theory
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• On the Ramsey multiplicities of graphs—problems and recent results
• On the critical percolation probabilities
• On the Computational Complexity of Combinatorial Problems
• Percolation Probabilities on the Square Lattice
• On the Chromatic Number of Subgraphs of a Given Graph
• Sharp thresholds of graph properties, and the $k$-sat problem
• Threshold Functions for H-factors
• Topological Cliques in Graphs
• On Tight Cycles in Hypergraphs
• Hunting for sharp thresholds
• Paths in graphs
• The number of k‐SAT functions
• On the Probability That a Random ± 1-Matrix Is Singular
• Topological cliques in graphs II
• The Minimum Size of Saturated Hypergraphs
• Packing trees of unbounded degrees in random graphs
• Triangle‐factors in pseudorandom graphs
• Decompositions into spanning rainbow structures
• The threshold for the square of a Hamilton cycle
• On the counting problem in inverse Littlewood–Offord theory
• Hitting times for Shamir’s problem
• Common and Sidorenko Linear Equations
• Large hypergraphs without tight cycles
• Low independence number and Hamiltonicity implies pancyclicity
• A survey of χ‐boundedness
• Cycles of many lengths in Hamiltonian graphs
• Almost all trees are almost graceful
• Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
• Non-concentration of the chromatic number of a random graph
• Wegner Estimate and Level Repulsion for Wigner Random Matrices
• SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS
• On an almost all version of the Balog-Szemeredi-Gowers theorem
• Large girth approximate Steiner triple systems
• Independent sets in hypergraphs
• Cycle packing
• Every list-decodable code for high noise has abundant near-optimal rate puncturings
• Computational Complexity
• A Problem in Graph Theory
• Decomposing Random Graphs into Few Cycles and Edges
• The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs
• Invertibility of symmetric random matrices
• A generalization of Turán's theorem
• Weak saturation numbers for sparse graphs
• The Representation of a Graph by Set Intersections
• On generalized graphs
• A lower bound for the order of a partial transversal in a latin square
• On the existence of a factor of degree one of a connected random graph
• On the Number of Combinatorial Geometries
• On the maximal number of independent circuits in a graph
• Maximum distance<tex>q</tex>-nary codes
• On the $AC^0$ Complexity of Subgraph Isomorphism
• Some Theorems on Abstract Graphs
• The number of partial Steiner systems and d-partitions
• The regularity method for graphs with few 4‐cycles
• Near-perfect clique-factors in sparse pseudorandom graphs
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• Optimal path and cycle decompositions of dense quasirandom graphs
• Complete mappings of finite groups
• 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
• An upper bound for \(d\)-dimensional difference sets
• Crossing probabilities for planar percolation
• A proof of the Kahn–Kalai conjecture
• Finding any given 2‐factor in sparse pseudorandom graphs efficiently
• On the size of \(A+ \lambda A\) for algebraic \(\lambda \)
• Linear configurations containing 4-term arithmetic progressions are uncommon
• 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, probability and computing. Abstracts from the workshop held April 24--30, 2022