Problems close to my heart
From MaRDI portal
Publication:6116410
DOI10.1016/j.ejc.2023.103695zbMath1518.05068MaRDI QIDQ6116410
Publication date: 18 July 2023
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/162708/1/ejc40.pdf
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximate version of the tree packing conjecture
- Vertex covers by monochromatic pieces -- a survey of results and problems
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Complements of nearly perfect graphs
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- A counterexample to the Alon-Saks-Seymour conjecture and related problems
- Chromatic Ramsey number of acyclic hypergraphs
- An improved bound for the monochromatic cycle partition number
- Split and balanced colorings of complete graphs
- Fruit salad
- Chromatic number of graphs each path of which is 3-colourable
- Ramsey-nice families of graphs
- Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture
- Three-color Ramsey numbers for paths
- Decompositions of edge-colored infinite complete graphs into monochromatic paths
- Packing trees into \(n\)-chromatic graphs
- A characterization of perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- Ramsey's theorem for a class of categories
- Ramsey theory on Steiner triples
- Generalizations of the tree packing conjecture
- A survey of χ‐boundedness
- An Extension of Mantel’s Theorem to k-Graphs