Sparse graphs are near-bipartite

03/29/2019
by   Daniel W. Cranston, et al.
0

A multigraph G is near-bipartite if V(G) can be partitioned as I,F such that I is an independent set and F induces a forest. We prove that a multigraph G is near-bipartite when 3|W|-2|E(G[W])|> -1 for every W⊆ V(G), and G contains no K_4 and no Moser spindle. We prove that a simple graph G is near-bipartite when 8|W|-5|E(G[W])|> -4 for every W⊆ V(G), and G contains no subgraph from some finite family H. We also construct infinite families to show that both results are best possible in a very sharp sense.

READ FULL TEXT
research
11/11/2020

Kings in Multipartite Hypertournaments

In his paper "Kings in Bipartite Hypertournaments" (Graphs & Combinatori...
research
07/06/2020

On B_1-EPG and EPT graphs

This research contains as a main result the prove that every Chordal B_1...
research
08/03/2018

Searching for square-complementary graphs: non-existence results and complexity of recognition

A graph is square-complementary (squco, for short) if its square and com...
research
10/19/2015

Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes

Consider a regular triangulation of the convex-hull P of a set A of n p...
research
10/09/2018

On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs

Numerous problems consisting in identifying vertices in graphs using dis...
research
11/29/2018

Incremental Sparse TFIDF & Incremental Similarity with Bipartite Graphs

In this report, we experimented with several concepts regarding text str...
research
10/28/2021

Finding a Concise, Precise, and Exhaustive Set of Near Bi-Cliques in Dynamic Graphs

A variety of tasks on dynamic graphs, including anomaly detection, commu...

Please sign up or login with your details

Forgot password? Click here to reset