On Graphs and the Gotsman-Linial Conjecture for d = 2

09/19/2017
by   Hyo Won Kim, et al.
0

We give an infinite class of counterexamples to the Gotsman-Linial conjecture when d = 2. On the other hand, we establish an asymptotic form of the conjecture for quadratic threshold functions whose non-zero quadratic terms define a graph with either low fractional chromatic number or few edges. Our techniques are elementary and our exposition is self-contained, if you're into that.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/20/2021

Tuza's Conjecture for Threshold Graphs

Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjo...
research
05/17/2022

Coloring circle arrangements: New 4-chromatic planar graphs

Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement gr...
research
07/05/2018

On the Menezes-Teske-Weng's conjecture

In 2003, Alfred Menezes, Edlyn Teske and Annegret Weng presented a conje...
research
01/20/2023

Separating the edges of a graph by a linear number of paths

Recently, Letzter proved that any graph of order n contains a collection...
research
12/23/2022

Counterexamples to a Conjecture of Dombi in Additive Number Theory

We disprove a 2002 conjecture of Dombi from additive number theory. More...
research
06/08/2020

Crouzeix's Conjecture and related problems

In this paper, we establish several results related to Crouzeix's conjec...
research
09/07/2022

On the Second Kahn–Kalai Conjecture

For any given graph H, we are interested in p_crit(H), the minimal p suc...

Please sign up or login with your details

Forgot password? Click here to reset