Regular decomposition of the edge set of a graph with applications
From MaRDI portal
Publication:6562433
zbMATH Open1542.05143MaRDI QIDQ6562433
Publication date: 26 June 2024
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new proof of the graph removal lemma
- Pentagons vs. triangles
- Quick approximation to matrices and applications
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Ramsey numbers for sparse graphs
- Bounds for graph regularity and removal lemmas
- Resolution of the Oberwolfach problem
- The probabilistic method
- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs
- Graph removal lemmas
- Regularity partitions and the topology of graphons
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
- On sets of integers containing k elements in arithmetic progression
- The Algorithmic Aspects of the Regularity Lemma
- A note on the maximum number of triangles in a C5‐free graph
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- On Some Sequences of Integers
- The regularity method for graphs with few 4‐cycles
- Holes in graphs
- Triangles in C5‐free graphs and hypergraphs of girth six
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)
