Fractional hypergraph isomorphism and fractional invariants

08/19/2020
by   Flavia Bonomo-Braberman, et al.
0

Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like connectivity, clique and independence numbers, chromatic number, vertex and edge cover numbers, matching number, domination and total domination numbers. In this work, we extend the concept of fractional graph isomorphism to hypergraphs, and give an alternative characterization, analogous to one of those that are known for graphs. With this new concept we prove that the fractional packing, covering, matching and transversal numbers on hypergraphs are invariant under fractional hypergraph isomorphism. As a consequence, fractional matching, vertex and edge cover, independence, domination and total domination numbers are invariant under fractional graph isomorphism. This is not the case of fractional chromatic, clique, and clique cover numbers. In this way, most of the classical fractional parameters are classified with respect to their invariance under fractional graph isomorphism.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/30/2019

Linear Programming complementation and its application to fractional graph theory

In this paper, we introduce a new kind of duality for Linear Programming...
research
07/03/2020

Fractional Covers of Hypergraphs with Bounded Multi-Intersection

Fractional (hyper-)graph theory is concerned with the specific problems ...
research
11/28/2018

Fractional coloring with local demands

We investigate fractional colorings of graphs in which the amount of col...
research
03/29/2019

Fractional matchings and component-factors of (edge-chromatic critical) graphs

The paper studies component-factors of graphs which can be characterized...
research
07/21/2022

Noncommutative extensions of parameters in the asymptotic spectrum of graphs

The zero-error capacity of a classical channel is a parameter of its con...
research
11/19/2018

Equitable Partitions into Matchings and Coverings in Mixed Graphs

Matchings and coverings are central topics in graph theory. The close re...
research
07/07/2021

Fractional homomorphism, Weisfeiler-Leman invariance, and the Sherali-Adams hierarchy for the Constraint Satisfaction Problem

Given a pair of graphs A and B, the problems of deciding whether there e...

Please sign up or login with your details

Forgot password? Click here to reset