Reflect-push methods. Part I: Two dimensional techniques

DOI10.37236/12043arXiv2307.05315MaRDI QIDQ6194254

Nikola Kuzmanovski, Jamie Radcliffe

Publication date: 19 March 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.05315

zbMATH Keywords

Ahlswede-Cai local-global principleisoperimetric problems on graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• The minimum number of disjoint pairs in set systems and related problems
• Graphs with the fewest matchings
• A new approach to Macaulay posets
• The complete intersection theorem for systems of finite sets
• On partitioning of hypergraphs
• Fractional set systems with few disjoint pairs
• Edge-isoperimetric inequalities in the grid
• On a problem of Kleitman and West
• A note on the edges of the n-cube
• On an equivalence in discrete extremal problems
• General edge-isoperimetric inequalities. I: Information-theoretical methods
• General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions
• An edge-isoperimetric problem for powers of the Petersen graph
• The edge-isoperimetric problem for discrete tori
• New infinite family of regular edge-isoperimetric graphs
• Set systems with few disjoint pairs
• Edge-isoperimetric problems for Cartesian powers of regular graphs
• Edge isoperimetric theorems for integer point arrays
• Structure and supersaturation for intersecting families
• Rearrangements of \((0,-1)\) matrices
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Graphs with maximal number of adjacent pairs of edges
• Assignment of Numbers to Vertices
• A Counterexample to Kleitman's Conjecture Concerning an Edge-Isoperimetric Problem
• A Note on Edge Isoperimetric Numbers and Regular Graphs
• Remarks on an Edge Isoperimetric Problem
• Appendix: On Edge–Isoperimetric Theorems for Uniform Hypergraphs
• Maximally Connected Arrays on the n-Cube
• A generalization of a combinatorial theorem of macaulay
• Sets of Lattice Points which Contain a Maximal Number of Edges
• Configurations Maximizing the Number of Pairs of Hamming‐Adjacent Lattice Points
• Optimal Assignments of Numbers to Vertices
• A pushing-pulling method: New proofs of intersection theorems

This page was built for publication: Reflect-push methods. Part I: Two dimensional techniques