Graph theory. Abstracts from the workshop held January 2--8, 2022
From MaRDI portal
Publication:2693028
DOI10.4171/OWR/2022/1zbMath1506.00075OpenAlexW4323828043MaRDI QIDQ2693028
No author found.
Publication date: 17 March 2023
Published in: Oberwolfach Reports (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/owr/2022/1
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Collections of abstracts of lectures (00B05) Graph theory (05Cxx)
Related Items
Cites Work
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- Subgraphs of large connectivity and chromatic number in graphs of large chromatic number
- On the presence of disjoint subgraphs of a specified type
- A Combinatorial Decomposition Theory
- On the Ramsey multiplicities of graphs—problems and recent results
- A Polynomial Solution to the Undirected Two Paths Problem
- On Graphs Which Contain All Sparse Graphs
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- The minimum number of subgraphs in a graph and its complement
- Every planar map is four colorable
- Connectivity, graph minors, and subgraph multiplicity
- Topological Cliques in Graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Asymptotic Size Ramsey Results for Bipartite Graphs
- Sparse exchangeable graphs and their limits via graphon processes
- Sketching and Embedding are Equivalent for Norms
- Constructive algorithm for path-width of matroids
- Sparse Graphs Using Exchangeable Random Measures
- Optimal Induced Universal Graphs and Adjacency Labeling for Trees
- Some advances on Sidorenko's conjecture
- On size Ramsey number of paths, trees, and circuits. I
- On Universal Graphs for Spanning Trees
- Nonrepetitive colorings of graphs
- Minors in graphs of large girth
- Topological cliques in graphs II
- Circle graphs are quadratically χ‐bounded
- Tree densities in sparse graph classes
- Hypergraphs with no tight cycles
- Adjacency Labelling for Planar Graphs (and Beyond)
- A survey of χ‐boundedness
- The Ramsey number of books
- Planar graphs have bounded nonrepetitive chromatic number
- Graphs of bounded cliquewidth are polynomially $χ$-bounded
- Planar Graphs Have Bounded Queue-Number
- The Directed Flat Wall Theorem
- Shorter Labeling Schemes for Planar Graphs
- Improved bounds for centered colorings
- Edge‐coloring linear hypergraphs with medium‐sized edges
- Polynomial bounds for the grid-minor theorem
- On Independent Circuits Contained in a Graph
- Representation of Large Matchings in Bipartite Graphs
- On the Queue Number of Planar Graphs
- There exist graphs with super‐exponential Ramsey multiplicity constant
- Two Chromatic Conjectures: One for Vertices and One for Edges
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
- Tree decompositions and social graphs
- On tripartite common graphs
- Queue layouts of planar 3-trees
- Diagonal Ramsey via effective quasirandomness
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth
- 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
- Restricted frame graphs and a conjecture of Scott
- An improved bound on the sizes of matchings guaranteeing a rainbow matching
- The number of \(C_{2\ell}\)-free graphs
- Outerplanar obstructions for matroid pathwidth
- Triangle-free intersection graphs of line segments with large chromatic number
- Classes of graphs with small rank decompositions are \(\chi \)-bounded
- Sparsity. Graphs, structures, and algorithms
- Graph clustering
- Substitution and \(\chi\)-boundedness
- Graph layouts via layered separators
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
- Rainbow matchings and rainbow connectedness
- Rainbow matchings in bipartite multigraphs
- Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
- Complete minors in \(K_{s,s}\)-free graphs
- An approximate version of Sidorenko's conjecture
- Large minors in graphs with given independence number
- Graph minors. XX: Wagner's conjecture
- A new upper bound for diagonal Ramsey numbers
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
- Lower bound of the Hadwiger number of graphs by their average degree
- Supersaturated graphs and hypergraphs
- Girth in graphs
- The strong perfect graph theorem
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Limits of dense graph sequences
- Nonrepetitive colorings of graphs of bounded tree-width
- Every minor-closed property of sparse graphs is testable
- Graph minors XXIII. Nash-Williams' immersion conjecture
- On the chromatic number of multiple interval graphs and overlap graphs
- Graph minors. V. Excluding a planar graph
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
- A coloring problem related to the Erdős, Faber, Lovasz conjecture
- Decomposition of regular matroids
- Hadwiger's conjecture is true for almost every graph
- Disjoint paths in graphs
- 2-linked graphs
- Packing nearly-disjoint sets
- Graph minors. X: Obstructions to tree-decomposition
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- A fractional version of the Erdős-Faber-Lovász conjecture
- Transversals of latin squares and their generalizations
- The size Ramsey number
- Upper bounds on the size of obstructions and intertwines
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- On the excluded minors for the matroids of branch-width \(k\)
- Graph minors. XVI: Excluding a non-planar graph
- An approximate version of a conjecture of Aharoni and Berger
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- On the local approach to Sidorenko's conjecture
- Gallai's path decomposition conjecture for graphs of small maximum degree
- Directed tree-width
- Branch-width and well-quasi-ordering in matroids and graphs.
- Recurrence of distributional limits of finite planar graphs
- Graph minors. XIII: The disjoint paths problem
- Multiplicities of subgraphs
- Rainbow Turán problem for even cycles
- Recurrence of planar graph limits
- Polynomial bounds for centered colorings on proper minor-closed graph classes
- The grid theorem for vertex-minors
- Non-bipartite \(k\)-common graphs
- Progress towards Nash-Williams' conjecture on triangle decompositions
- Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded
- Finite reflection groups and graph norms
- The size Ramsey number of a complete bipartite graph
- A correlation inequality for bipartite graphs
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- Triangle-free graphs of tree-width \(t\) are \(\lceil (t+3)/2 \rceil\)-colorable
- Profiles of separations: in graphs, matroids, and beyond
- Obstructions for linear rank-width at most 1
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Rank-width and vertex-minors
- Large matchings in bipartite graphs have a rainbow matching
- Graph minors. IV: Tree-width and well-quasi-ordering
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
- Rainbow Turán number of clique subdivisions
- Burling graphs revisited. I: New characterizations
- Hadwiger’s Conjecture
- Non-Three-Colourable Common Graphs Exist
- On a Generalization of the Ryser-Brualdi-Stein Conjecture
- Small Dense Subgraphs of a Graph
- Excluded vertex-minors for graphs of linear rank-width at most k.
- Complete Minors and Independence Number
- Recent developments in graph Ramsey theory
- On Sets of Acquaintances and Strangers at any Party
- An extremal function for contractions of graphs
- Sidorenko's conjecture for blow-ups
- Rainbow Turán Problems
- On Hadwiger's Number and the Stability Number
