Researchain
Decentralized Journals
A
Archives
Welcome to Researchain!
Feedback Center
Decentralized Journals
A
Archives
Updated
Mathematics
Combinatorics
Books in graphs
Bela Bollobas
,
Vladimir Nikiforov
Abstract
A book of size q is a set of q triangles sharing a common edge. We study the size of the maximal book in a graph as a function of the number of its edges. In particular, we answer two questions of Erdos about graphs that are union of triangles.
Full PDF
Related Researches
More about Exact Slow k -Nim
by
Nikolay Chikin
Maximal distance spectral radius of 4-chromatic planar graphs
by
Aysel Erey
Toric Codes from Order Polytopes
by
Mahir Bilen Can
On the Signed Complete Graphs with Maximum Index
by
N. Kafai
Spanning trees in dense directed graphs
by
Amarja Kathapurkar
Twin-width IV: low complexity matrices
by
?douard Bonnet
On multichromatic numbers of widely colorable graphs
by
Anna Gujgiczer
Expected Value of Statistics on Type-B Permutation Tableaux
by
Ryan Althoff
Length of a Full Steiner Tree as a Function of Terminal Coordinates
by
Alexei Yu. Uteshev
Sum-distinguishing number of sparse hypergraphs
by
Maria Axenovich
On list chromatic numbers of 2-colorable hypergraphs
by
Danila Cherkashin
Hex implies Y
by
Tomasz Prytu?a
New upper bounds for the forgotten index among bicyclic graphs
by
A. Jahanbani
Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
by
Mingqing Zhai
Tournaments with maximal decomposability
by
Cherifa Ben Salha
There are only a finite number of excluded minors for the class of bicircular matroids
by
Matt DeVos
Factorizations of Complete Multipartite Hypergraphs
by
Amin Bahmanian
Extending Edge-colorings of Complete Hypergraphs into Regular Colorings
by
Amin Bahmanian
Twenty Vertex model and domino tilings of the Aztec triangle
by
Philippe Di Francesco
On a metric property of perfect colorings
by
Anna A. Taranenko
Partial-dual genus polynomials and signed intersection graphs
by
Qi Yan
Hamiltonicity of graphs perturbed by a random geometric graph
by
Alberto Espuny Díaz
A unified half-integral Erd?s-Pósa theorem for cycles in graphs labelled by multiple abelian groups
by
J. Pascal Gollin
Optimally reconnecting weighted graphs against an edge-destroying adversary
by
Daniel C. McDonald
Reconstruction of small graphs and tournaments
by
Brendan D. McKay
«
1
2
3
4
»
Submitted on 5 May 2004
Updated
arXiv.org
Original Source
NASA ADS
Google Scholar
Semantic Scholar