A Note on Bipartite Graphs Without 2k-Cycles

By Assaf Naor, Jacques Verstraëte. Combinatorics, probability & computing, 2005

70 citations recorded by the source corpus.

Subfields: Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/afab1723e458194548abc14fa8161441dc1a4927

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

1. Jacques Verstraëte
2. Z. Furedi
3. Assaf Naor
4. Robert Morris
5. David Saxton
6. Richard Montgomery
7. Hong Liu

In Electrical and Electronic Engineering

1. Jacques Verstraëte
2. Z. Furedi
3. Assaf Naor

Citations in the corpus

• Extremal problems for cycles in graphs (2016, methodology): “Using the method for proving Theorem 4, the following was established by Naor and the author [103]:”
• On the Turán number for the hexagon (2006, methodology): “The proofs of Lemmas 6.1 and 6.2 use the following result from [ 26 ] and [34]:”