Explicit Ramsey graphs and orthonormal labelings.

Alon, Noga

The search session has expired. Please query the service again.

Displaying similar documents to “Explicit Ramsey graphs and orthonormal labelings.”

Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces.

Le Anh Vinh (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Problems in algebraic combinatorics.

Godsil, C.D. (1994)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Distinct distances in graph drawings.

Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Another infinite sequence of dense triangle-free graphs.

Brandt, Stephan, Pisanski, Tomaž (1998)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Chromatic number for a generalization of Cartesian product graphs.

Král&#039;, Daniel, West, Douglas B. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A survey of minimum saturated graphs.

Faudree, Jill R., Faudree, Ralph J., Schmitt, John R. (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Upper and lower bounds for $F_{v} (4, 4; 5)$ .

Xu, Xiaodong, Luo, Haipeng, Shao, Zehui (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Bounds on the Signed 2-Independence Number in Graphs

Lutz Volkmann (2013)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a finite and simple graph with vertex set V (G), and let f V (G) → {−1, 1} be a two-valued function. If ∑x∈N|v| f(x) ≤ 1 for each v ∈ V (G), where N[v] is the closed neighborhood of v, then f is a signed 2-independence function on G. The weight of a signed 2-independence function f is w(f) =∑v∈V (G) f(v). The maximum of weights w(f), taken over all signed 2-independence functions f on G, is the signed 2-independence number α2s(G) of G. In this work, we mainly present upper bounds...

Clique-width and the speed of hereditary properties.

Allen, Peter, Lozin, Vadim, Rao, Michaël (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Dynamic cage survey.

Exoo, Geoffrey, Jajcay, Robert (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

New upper bounds on the order of cages.

Lazebnik, F., Ustimenko, V.A., Woldar, A.J. (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Signed k-independence in graphs

Lutz Volkmann (2014)

Open Mathematics

Similarity:

Let k ≥ 2 be an integer. A function f: V(G) → −1, 1 defined on the vertex set V(G) of a graph G is a signed k-independence function if the sum of its function values over any closed neighborhood is at most k − 1. That is, Σx∈N[v] f(x) ≤ k − 1 for every v ∈ V(G), where N[v] consists of v and every vertex adjacent to v. The weight of a signed k-independence function f is w(f) = Σv∈V(G) f(v). The maximum weight w(f), taken over all signed k-independence functions f on G, is the signed k-independence...

Degree sequences of $F$ -free graphs.

Pikhurko, Oleg, Taraz, Anusch (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity: