Ascending subgraph decomposition

DOI10.1016/J.JCTB.2025.01.003MaRDI QIDQ6987047zbMATH OpenFDO

Authors Kyriakos Katsamaktsis, Shoham Letzter, Alexey Pokrovskiy, Benny Sudakov

Publication date 7 May 2025

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2025.01.003

zbMATH Keywords

graph colouringgraph decompositionisomorphic subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A note on the ascending subgraph decomposition problem
• A proof of Ringel's conjecture
• Ascending subgraph decompositions of regular graphs
• Ascending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\)
• Asymptotic behavior of the chromatic index for hypergraphs
• Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
• scientific article; zbMATH DE number 4134095 (Why is no real title available?)
• scientific article; zbMATH DE number 4043890 (Why is no real title available?)
• scientific article; zbMATH DE number 4057554 (Why is no real title available?)
• scientific article; zbMATH DE number 3604921 (Why is no real title available?)
• scientific article; zbMATH DE number 1324671 (Why is no real title available?)
• scientific article; zbMATH DE number 4122038 (Why is no real title available?)
• scientific article; zbMATH DE number 3378938 (Why is no real title available?)
• Irregularity in graphs
• On star forest ascending subgraph decomposition
• On the ascending star subgraphs decomposition of star forests
• Optimal packings of bounded degree trees
• Partition of a set of integers into subsets with prescribed sums
• Resolution of the Oberwolfach problem
• Ringel's tree packing conjecture in quasirandom graphs
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• The generalised Oberwolfach problem
• The Solution of a Timetabling Problem
• Zero-sum partitions of Abelian groups of order 2ⁿ

This page was built for publication: Ascending subgraph decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987047)