Saved in:
Bibliographic Details
Main Author: Kuzmanovski, Nikola
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2401.08299
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914642577588224
author Kuzmanovski, Nikola
author_facet Kuzmanovski, Nikola
contents Ahlswede and Cai proved that if a simple graph has nested solutions (NS) under the edge-isoperimetric problems, and the lexicographic (lex) order produces NS for its second cartesian power,then the lex order produces NS for any finite cartesian power. Under very general assumptions, we prove that if a graph and its second cartesian power have NS,then so does any finite cartesian power. Harper asked if this is true without any restriction. We also conjecture that it is. All graphs studied in the literature for which the lex order is optimal are regular. This lead Bezrukov and Elsässer to conjecture that if the lex order is optimal for the second cartesian power, then the original graph is regular. A counterexample to this conjecture is provided.
format Preprint
id arxiv_https___arxiv_org_abs_2401_08299
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Towards a Complete Local-Global Principle
Kuzmanovski, Nikola
Combinatorics
Ahlswede and Cai proved that if a simple graph has nested solutions (NS) under the edge-isoperimetric problems, and the lexicographic (lex) order produces NS for its second cartesian power,then the lex order produces NS for any finite cartesian power. Under very general assumptions, we prove that if a graph and its second cartesian power have NS,then so does any finite cartesian power. Harper asked if this is true without any restriction. We also conjecture that it is. All graphs studied in the literature for which the lex order is optimal are regular. This lead Bezrukov and Elsässer to conjecture that if the lex order is optimal for the second cartesian power, then the original graph is regular. A counterexample to this conjecture is provided.
title Towards a Complete Local-Global Principle
topic Combinatorics
url https://arxiv.org/abs/2401.08299