Regular decomposition of the edge set of a graph with applications

MaRDI QIDQ6562433zbMATH OpenFDO

Authors Béla Csaba

Publication date 26 June 2024

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

graph embedding problems

Mathematics Subject Classification ID

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)

Recommendations

• The Algorithmic Aspects of the Regularity Lemma
• A blow-up lemma for approximate decompositions
• scientific article; zbMATH DE number 1256685
• Szemerédi’s Regularity Lemma for Sparse Graphs
• An Algorithmic Version of the Hypergraph Regularity Method

Cites work

• A new proof of the graph removal lemma
• A note on the maximum number of triangles in a C₅‐free graph
• Bounds for graph regularity and removal lemmas
• Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
• Graph removal lemmas
• Holes in graphs
• scientific article; zbMATH DE number 3604921 (Why is no real title available?)
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• Lower bounds of tower type for Szemerédi's uniformity lemma
• On sets of integers containing k elements in arithmetic progression
• On Some Sequences of Integers
• Pentagons vs. triangles
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• Quick approximation to matrices and applications
• Ramsey numbers for sparse graphs
• Regularity partitions and the topology of graphons
• Resolution of the Oberwolfach problem
• The Algorithmic Aspects of the Regularity Lemma
• The probabilistic method
• The regularity method for graphs with few 4‐cycles
• Triangles in C5‐free graphs and hypergraphs of girth six

Cited in

(1)

• Asymmetric results about graph homomorphisms

This page was built for publication: Regular decomposition of the edge set of a graph with applications

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