Premium
The solution to an extremal problem on balanced extensions of graphs
Author(s) -
Ruciński A.,
Vince A.
Publication year - 1993
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190170315
Subject(s) - mathematics , combinatorics , extension (predicate logic) , graph , order (exchange) , discrete mathematics , computer science , finance , economics , programming language
For n sufficiently large the order of a smallest balanced extension of a graph of order n is, in the worst case, ⌊( n + 3) 2 /8⌋. © 1993 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom