AI & ChatGPT searches , social queries for ODD GRAPH
Search references for ODD GRAPH. Phrases containing ODD GRAPH
See searches and references containing ODD GRAPH!
Search references for ODD GRAPH. Phrases containing ODD GRAPH
See searches and references containing ODD GRAPH!ODD GRAPH
Family of symmetric graphs which generalize the Petersen graph
of graph theory, the odd graphs are a family of symmetric graphs defined from certain set systems. They include and generalize the Petersen graph. The
Odd_graph
Graph divided into two independent sets
are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles. The two sets U {\displaystyle
Bipartite_graph
Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes
Glossary_of_graph_theory
Graph with nodes connected in a closed chain
vertices is called an even cycle; a cycle with an odd number of vertices is called an odd cycle. A cycle graph is: 2-edge colorable, if and only if it has an
Cycle_graph
Graph whose vertices correspond to combinations of a set of n elements
Kneser graph K(n, 2) is the complement of the line graph of the complete graph on n vertices. The Kneser graph K(2n − 1, n − 1) is the odd graph On; in
Kneser_graph
Every graph has evenly many odd vertices
In graph theory, the handshaking lemma is the statement that, in every finite undirected graph, the number of vertices that touch an odd number of edges
Handshaking_lemma
Trail in a graph that visits each edge once
cycle if the graph has no vertices of odd degree, or an Eulerian trail if there are exactly two vertices of odd degree. While the graph traversal in Fleury's
Eulerian_path
Graph with tight clique-coloring relation
In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every
Perfect_graph
Functions such that f(–x) equals f(x) or –f(x)
and it is odd if n is an odd integer. Even functions are those real functions whose graph is self-symmetric with respect to the y-axis, and odd functions
Even_and_odd_functions
Trail in which only the first and last vertices are equal
directed graph with no directed cycles Forest, a cycle-free graph Line perfect graph, a graph in which every odd cycle is a triangle Perfect graph, a graph with
Cycle_(graph_theory)
Cubic graph with 10 vertices and 15 edges
other. As a Kneser graph of the form KG2n−1,n−1 it is an example of an odd graph. Geometrically, the Petersen graph is the graph formed by the vertices
Petersen_graph
Partition of a graph into spanning subgraphs
If n is odd and k ≥ n, then G is 1-factorable. If n is even and k ≥ n − 1 then G is 1-factorable. More unsolved problems in mathematics In graph theory
Graph_factorization
7-regular undirected graph with 50 nodes and 175 edges
of graph theory, the Hoffman–Singleton graph is a 7-regular undirected graph with 50 vertices and 175 edges. It is the unique strongly regular graph with
Hoffman–Singleton_graph
Number of edges touching a vertex in a graph
biregular graph. An undirected, connected graph has an Eulerian path if and only if it has either 0 or 2 vertices of odd degree. If it has 0 vertices of odd degree
Degree_(graph_theory)
Undirected graph derived from a hypercube graph
is, in this case, the graph is bipartite) and four when k is odd. The odd girth of a folded cube of odd dimension is k, so for odd k greater than three
Folded_cube_graph
In graph theory, an odd cycle transversal of an undirected graph is a set of vertices of the graph that has a nonempty intersection with every odd cycle
Odd_cycle_transversal
Length of a shortest cycle contained in the graph
In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (that
Girth_(graph_theory)
Educational comedy television series
using data in graphs, etc.) to advance each episode's plot. The series features child actors (whose characters are the employees of the "Odd Squad") who
Odd_Squad
Graph representing edges of another graph
In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges
Line_graph
Perfect graphs have neither odd holes nor odd antiholes
class of graphs, Claude Berge observed that it is impossible for a perfect graph to contain an odd hole, an induced subgraph in the form of an odd-length
Strong_perfect_graph_theorem
Structure-preserving correspondence between node-link graphs
directed graph contains its core as a retract and as an induced subgraph. For example, all complete graphs Kn and all odd cycles (cycle graphs of odd length)
Graph_homomorphism
Regular graph with girth more than twice its diameter
Does a Moore graph with girth 5 and degree 57 exist? More unsolved problems in mathematics In graph theory, a Moore graph is a regular graph whose girth
Moore_graph
Triangle-free graph requiring four colors
triangle-free planar graph is 3-colorable. It has odd girth five but girth four, and does not have any graph homomorphism to a graph whose girth is five
Grötzsch_graph
Subgraph with contracted edges
In graph theory, an undirected graph H is called a minor of the undirected graph G if H can be formed from G by deleting edges and vertices and by contracting
Graph_minor
Characterization of graphs with perfect matchings
characterize all graphs that do not have a perfect matching. Start with the most obvious case of a graph without a perfect matching: a graph with an odd number
Tutte's theorem on perfect matchings
Tutte's_theorem_on_perfect_matchings
Chordal graph where all cycles of even length have odd chords
area of graph theory, an undirected graph G is strongly chordal if it is a chordal graph and every cycle of even length (≥ 6) in G has an odd chord, i
Strongly_chordal_graph
Assignment of colors to edges of a graph
In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color
Edge_coloring
Class of undirected graphs defined from systems of sets
mathematics, Johnson graphs are a special class of undirected graphs defined from systems of sets. The vertices of the Johnson graph J ( n , k ) {\displaystyle
Johnson_graph
Graph of n vertices with a perfect matching for every subgraph of n-1 vertices
In graph theory, a mathematical discipline, a factor-critical graph (or hypomatchable graph) is a graph with an odd number of vertices in which deleting
Factor-critical_graph
Mathematical graph relating to chess
In graph theory, a knight's graph, or a knight's tour graph, is a graph that represents all legal moves of the knight chess piece on a chessboard. Each
Knight's_graph
Cycle graph plus universal vertex
In graph theory, a wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle. A wheel graph with n vertices can
Wheel_graph
Methodic assignment of colors to elements of a graph
In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain
Graph_coloring
On graph coloring and neighborhood size
connected undirected graph G with maximum degree Δ, the chromatic number of G is at most Δ, unless G is a complete graph or an odd cycle, in which case
Brooks'_theorem
Graph with sign-labeled edges
appear in topological graph theory and group theory. They are a natural context for questions about odd and even cycles in graphs. They appear in computing
Signed_graph
In mathematics, a topological graph is a representation of a graph in the plane, where the vertices of the graph are represented by distinct points and
Topological_graph
Graph in which every two vertices are adjacent
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique
Complete_graph
Graph property
distance-regular graph form an association scheme. Some first examples of distance-regular graphs include: The complete graphs. The cycle graphs. The odd graphs. The
Distance-regular_graph
Graph path which is an induced subgraph
perfect graph theorem, the perfect graphs are the graphs with no odd hole and no odd antihole. The distance-hereditary graphs are the graphs in which
Induced_path
Type of graph in graph theory
symmetric graph must be vertex-transitive and edge-transitive, and the converse is true for graphs of odd degree, so that half-transitive graphs of odd degree
Half-transitive_graph
Complements of perfect graphs are perfect
In graph theory, the perfect graph theorem of László Lovász (1972a, 1972b) states that an undirected graph is perfect if and only if its complement graph
Perfect_graph_theorem
Finding shortest walks through all graph edges
of odd vertices, so a T-join always exists. Doubling the edges of a T-join causes the given graph to become an Eulerian multigraph (a connected graph in
Chinese_postman_problem
Derived graph of higher chromatic number
In the mathematical area of graph theory, the Mycielskian or Mycielski graph of an undirected graph is a larger graph formed from it by a construction
Mycielskian
Mathematical graph with at least one median per triple of vertices
odd cycle. Because they have no odd cycles, every modular graph is a bipartite graph. The modular graphs contain as a special case the median graphs,
Modular_graph
3-regular graph with no 3-edge-coloring
In the mathematical field of graph theory, a snark is an undirected graph with exactly three edges per vertex whose edges cannot be colored with only three
Snark_(graph_theory)
Cubic graph with 28 vertices and 42 edges
Coxeter graph. (See image.) This construction exhibits the Coxeter graph as an induced subgraph of the odd graph O4, also known as the Kneser graph KG7,3
Coxeter_graph
Graph of triangles with a shared vertex
the mathematical field of graph theory, the friendship graph (or Dutch windmill graph or n-fan) Fn is a planar, undirected graph with 2n + 1 vertices and
Friendship_graph
Graph where all long cycles have a chord
perfect graphs. Other superclasses of chordal graphs include weakly chordal graphs, cop-win graphs, odd-hole-free graphs, even-hole-free graphs, and Meyniel
Chordal_graph
Undirected, connected, and acyclic graph
In graph theory, a tree is an undirected graph in which every pair of distinct vertices is connected by exactly one path, or equivalently, a connected
Tree_(graph_theory)
Classic problem in graph theory
for the walk of the desired form is that the graph be connected and have exactly zero or two nodes of odd degree. This condition turns out also to be sufficient—a
Seven_Bridges_of_Königsberg
Graph where each vertex has the same number of neighbors
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular
Regular_graph
{\displaystyle n} is odd or even and k ≥ n , n − 1 {\displaystyle k\geq n,n-1} , respectively, then a k {\displaystyle k} -regular graph with 2 n {\displaystyle
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
Grünbaum. The Levi graph of the configuration is the Kronecker cover of the odd graph O4, and is isomorphic to the middle layer graph of the seven-dimensional
Danzer's_configuration
Graph whose shortest paths are unique
tree, every complete graph, and every odd-length cycle graph is geodetic. If G {\displaystyle G} is a geodetic graph, then replacing every edge of G {\displaystyle
Geodetic_graph
Graph where any two induced paths between nodes both have odd or even lengths
In graph theory, a parity graph is a graph in which all induced paths between the same two vertices have the same parity: either all paths have odd length
Parity_graph
Property of being an even or odd number
arithmetic. even ± even = even; even ± odd = odd; odd ± odd = even; even × even = even; even × odd = even; odd × odd = odd. By construction in the previous
Parity_(mathematics)
Natural number
in mathematics Is 5 the only odd, untouchable number? More unsolved problems in mathematics In graph theory, all graphs with four or fewer vertices are
5
All Odd Squad episodes
Odd Squad is a live-action television series that premiered on TVOKids in Canada and PBS Kids in the United States on November 26, 2014, both on the same
List_of_Odd_Squad_episodes
Partition of graph into sequence of paths
edges. A factor-critical graph is a graph with an odd number of vertices, such that for each vertex v, if v is removed from the graph then the remaining vertices
Ear_decomposition
Unproven generalization of the four-color theorem
{\displaystyle k=3} is also easy: the graphs requiring three colors are the non-bipartite graphs, and every non-bipartite graph has an odd cycle, which can be contracted
Hadwiger conjecture (graph theory)
Hadwiger_conjecture_(graph_theory)
certain cycles (the "even central cycles") have an odd number of edges in each direction. When a graph has a Pfaffian orientation, the orientation can be
Pfaffian_orientation
Graph where all pairs of vertices are automorphic
edge-transitive non-bipartite graphs with odd vertex degrees. The edge-connectivity of a connected vertex-transitive graph is equal to the degree d, while
Vertex-transitive_graph
Open problem on 3x+1 and x/2 functions
8, 4, 2, 1 . The sequence for n = 27, listed and graphed below, takes 111 steps (41 steps through odd numbers, in bold), climbing as high as 9232 before
Collatz_conjecture
Geometric graph with unit edge lengths
In mathematics, particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting
Unit_distance_graph
Set of edges without common vertices
exactly one vertex is unmatched. Clearly, a graph can only contain a near-perfect matching when the graph has an odd number of vertices, and near-perfect matchings
Matching_(graph_theory)
Mathematical graph theorem
bridgeless graph G = (V, E) we have that for every set U ⊆ V the number of connected components in the graph induced by V − U with an odd number of vertices
Petersen's_theorem
Graphical representation of a computer program or algorithm
In computer science, a control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a function during
Control-flow_graph
Special case of a strongly regular graph
graph for every number of vertices v > 1 {\displaystyle v>1} where v ≡ 1 mod 4 {\displaystyle v\equiv 1{\bmod {4}}} and v {\displaystyle v} is an odd
Conference_graph
Multi-lobed plane curve
are odd, and 2n otherwise. In the case when both n and d are odd, the positive and negative half-cycles of the sinusoid are coincident. The graph of these
Rose_(mathematics)
Characterization of the size of a maximum matching in a graph
{odd} (G-U)+|V|\right),} where odd ( H ) {\displaystyle \operatorname {odd} (H)} counts how many of the connected components of the graph H {\displaystyle
Tutte–Berge_formula
Family of triangle-free circulant graphs
Mota, Ch. Reiher, M. Schacht, On the local density problem for graphs of given odd-girth, Electronic Notes in Discrete Mathematics, Volume 62, 2017
Andrásfai_graph
Eulerian, non-hamiltonian, tough graph
In graph theory, a Harris graph is defined as an Eulerian, tough, non-Hamiltonian graph. Harris graphs were introduced in 2013 when, at the University
Harris_graph
Algorithm for finding max graph matchings
along augmenting paths in the graph. Unlike bipartite matching, the key new idea is that an odd-length cycle in the graph (blossom) is contracted to a
Blossom_algorithm
Quality of zero being an even number
proof explaining why an odd number is nonzero. A classic result of graph theory states that a graph of odd order (having an odd number of vertices) always
Parity_of_zero
Graph without four-vertex star subgraphs
In graph theory, an area of mathematics, a claw-free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the
Claw-free_graph
Graph linking pairs of comparable elements in a partial order
Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, containment graphs, and divisor graphs. An incomparability
Comparability_graph
Path in a graph that visits each vertex exactly once
given graph. A complete graph with more than two vertices is Hamiltonian Every cycle graph is Hamiltonian Every tournament has an odd number of Hamiltonian
Hamiltonian_path
Describing a family of graphs by excluding certain (sub)graphs
In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to
Forbidden graph characterization
Forbidden_graph_characterization
Positive-definite integral set of repeated points with Abelian group-rank 24
The Kneser neighborhood graph in 8n dimensions has a point for each even lattice, and a line joining two points for each odd 8n dimensional lattice with
Niemeier_lattice
Graph where all odd cycles of length ≥ 5 has 2+ chords
In graph theory, a Meyniel graph is a graph in which every odd cycle of length five or more has at least two chords (edges connecting non-consecutive
Meyniel_graph
{\displaystyle |X|} is a power of an odd prime. For every natural number n, there is a finite group whose commuting graph is connected and has diameter equal
Commuting_graph
Graphs formed by a hypercube's edges and vertices
In graph theory, the hypercube graph Q n {\displaystyle Q_{n}} is the edge graph of the n {\displaystyle n} -dimensional hypercube, that is, it is the
Hypercube_graph
Given a simple graph G = (V,E), the set of triples of the vertex set V whose induced subgraph has an odd number of edges forms a two-graph on the set V
Two-graph
Tree graph with one central node and leaves of length 1
Sk is edge-graceful when k is even and not when k is odd. It is an edge-transitive matchstick graph, and has diameter 2 (when k > 1), girth ∞ {\displaystyle
Star_(graph_theory)
Infinite graph containing all countable graphs
In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with
Rado_graph
Mathematical graph relating to chess
sides are odd. A component of the bishop's graph can be treated as a rook's graph on a diamond if the original board is square and has sides of odd length
Bishop's_graph
Graph of chess rook moves
In graph theory, a rook's graph is an undirected graph that represents all legal moves of the rook chess piece on a chessboard. Each vertex of a rook's
Rook's_graph
Assignment of labels to elements of a graph
discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to edges and/or vertices of a graph. Formally
Graph_labeling
Vertex adjacent to all others in a graph
be counted by inclusion–exclusion, showing that there are an odd number of such graphs on any even number of vertices. This, in turn, can be used to
Universal_vertex
where the largest graphs are cycles with an odd number of vertices). Below is the table of the vertex numbers for the best-known graphs (as of June 2024)
Table of the largest known graphs of a given diameter and maximal degree
Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree
Graph without triples of adjacent vertices
area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle-free graphs may be equivalently
Triangle-free_graph
( S ) {\displaystyle \displaystyle \Delta (G)=\Delta (S)} . Every odd cycle graph of length three or more is overfull. The product of its degree (two)
Overfull_graph
Fewest edge crossings in drawing of a graph
graph theory, the crossing number cr(G) of a graph G is the lowest number of edge crossings of a plane drawing of the graph G. For instance, a graph is
Crossing number (graph theory)
Crossing_number_(graph_theory)
In graph theory, a fractional matching is a generalization of a matching in which, intuitively, each vertex may be broken into fractions that are matched
Fractional_matching
Graph in which all ordered pairs of linked nodes are automorphic
edge-transitive, and the converse is true for graphs of odd degree. However, for even degree, there exist connected graphs which are vertex-transitive and edge-transitive
Symmetric_graph
Conjecture in graph theory
bipartite, then both contain a cycle of odd length. Since the product of two odd cycle graphs contains an odd cycle, the product G × H is not 2-colorable
Hedetniemi's_conjecture
bivarigated graph G with 2n vertices, there exists a set of n independent edges such that no odd number of them lie on a cycle of G. The Petersen graph, shown
Bivariegated_graph
{\displaystyle P_{k}} -graphs are Eulerian. P k {\displaystyle P_{k}} -graphs are not bipartite: if k {\displaystyle k} is odd and v , w {\displaystyle
Kotzig's_conjecture
Point where the curvature of a curve changes sign
at which the curvature changes sign. In particular, in the case of the graph of a function, it is a point where the function changes from being concave
Inflection_point
6-regular graph with 57 vertices and 171 edges
the Perkel graph, named after Manley Perkel, is a 6-regular graph with 57 vertices and 171 edges. It is the unique distance-regular graph with intersection
Perkel_graph
properties. Every stepwise irregular graph is bipartite. This follows from the fact that SI graphs cannot contain odd cycles. In any cycle, moving along
Stepwise_irregular_graph
ODD GRAPH
ODD GRAPH
Male
English
English surname transferred to forename use, from a byname for a cunning person or someone with red hair, from Middle English todde, TODD means "fox."
Female
English
 English name derived from Greek oide, ODA means "song." Compare with another form of Oda.
Male
German
Variant form of German Otto, ODO means "wealthy."
Surname or Lastname
English
English : variant of Rhodes.German : variant of Rode 1.
Surname or Lastname
English
English : from Middle English old, not necessarily implying old age, but rather used to distinguish an older from a younger bearer of the same personal name.North German form of Alt, like the English name a distinguishing name for the older of two bearers of a personal name.Americanized form of German Alt.
Male
French
Old French form of German Otto, ODA means "wealthy." Compare with feminine Oda.
Surname or Lastname
English and Scottish
English and Scottish : from the Middle English personal name Dodde, Dudde, Old English Dodda, Dudda, which remained in fairly widespread and frequent use in England until the 14th century. It seems to have been originally a byname, but the meaning is not clear; it may come from a Germanic root used to describe something round and lumpish—hence a short, plump man.Irish : of English origin, taken to Sligo in the 16th century by a Shropshire family; also sometimes adopted by bearers of the Gaelic name Ó Dubhda (see Dowd).Daniel and Mary Dod, natives of England, emigrated to Branford, CT, in about 1645.
Girl/Female
Egyptian
From the road.
Girl/Female
German American Norse
Elfin spear.
Male
Norse
Old Norse name derived from the word oddr, ODDR means "point of a weapon."
Female
German
 Feminine form of German Odo, ODA means "wealthy." Compare with another form of Oda.
Surname or Lastname
English (Northumbria) and Scottish
English (Northumbria) and Scottish : habitational name from East Ord in Northumberland, named with Old English ord ‘point’. Compare Ort 3.English : from a Germanic personal name (see Ort 2).Scottish : habitational name from various minor places named with Gaelic ord ‘hammer’, used as a topographical term for a rounded hill.
Surname or Lastname
English (mainly northern) and Scottish
English (mainly northern) and Scottish : nickname for someone thought to resemble a fox, for example in cunning or slyness, or perhaps more obviously in having red hair, from northern Middle English tod(de) ‘fox’ (of unknown origin).
Surname or Lastname
English
English : metonymic occupational name for a maker of purses and bags, from Middle English cod ‘bag’.English : nickname for a man noted for his apparent sexual prowess, from cod(piece), in Tudor times the garment worn prominently over the male genitals.English : from Middle English cod, the fish (of uncertain origin, perhaps a transferred use of 1), applied as a metonymic occupational name for a fisherman or seller of these fish, or possibly as a nickname for someone thought to resemble the fish in some way.Irish : variant of Cody.Irish (County Wexford) : from the Anglo-Saxon personal name Cod.
Male
English
Anglicized form of Hebrew Owded, ODED means "restorer." In the bible, this is the name of the father of Azariah, and the name of a prophet who lived in the time of King Ahaz.
Surname or Lastname
English
English : from the Middle English personal name Ode (see Ott).
Male
Norwegian
Norwegian form of Old Norse Oddr, ODD means "point of a weapon."
Boy/Male
English German
Famous ruler.
Surname or Lastname
English
English : nickname from Middle English pode ‘toad’.
Girl/Female
Norse
Point.
ODD GRAPH
ODD GRAPH
Girl/Female
Hindu
Melodious
Girl/Female
Christian & English(British/American/Australian)
Fighter
Female
English
Modern English name derived from Latin anima, ANIMA means "anger, courage, essence, feeling, mind, passion, spirit," from the PIE root *ane-, meaning "to breathe," the same root from which the words animal and animation came. But in Christian contexts, the word anima was used to translate the Greek word psykhe into "soul" (not "spirit"), and this is the same anima from which the personal name was derived. Compare with another form of Anima.
Surname or Lastname
English
English : variant of Keighley.
Boy/Male
Hindu
Brilliance, Lord of excellent intellect
Boy/Male
Hindu
Energy, Name of a sage
Boy/Male
Sikh
Prince of omniscient God
Male
German
German form of Late Latin Ægidius, ÄGIDIUS means "kid; young goat" or "shield of goatskin."
Girl/Female
Native American
Pelican.
Boy/Male
Indian
Soldier
ODD GRAPH
ODD GRAPH
ODD GRAPH
ODD GRAPH
ODD GRAPH
superl.
Formerly existing; ancient; not modern; preceding; original; as, an old law; an old custom; an old promise.
superl.
Old-fashioned; wonted; customary; as of old; as, the good old times; hence, colloquially, gay; jolly.
superl.
Worn out; weakened or exhausted by use; past usefulness; as, old shoes; old clothes.
v. t.
Alt. of Dod
superl.
Different from what is usual or common; unusual; singular; peculiar; unique; strange.
superl.
Not paired with another, or remaining over after a pairing; without a mate; unmatched; single; as, an odd shoe; an odd glove.
superl.
Not divisible by 2 without a remainder; not capable of being evenly paired, one unit with another; as, 1, 3, 7, 9, 11, etc., are odd numbers.
superl.
Left over after a definite round number has been taken or mentioned; indefinitely, but not greatly, exceeding a specified number; extra.
superl.
Remaining over; unconnected; detached; fragmentary; hence, occasional; inconsiderable; as, odd jobs; odd minutes; odd trifles.
superl.
Continued in life; advanced in the course of existence; having (a certain) length of existence; -- designating the age of a person or thing; as, an infant a few hours old; a cathedral centuries old.
superl.
Not young; advanced far in years or life; having lived till toward the end of the ordinary term of living; as, an old man; an old age; an old horse; an old tree.
a.
Old-fashioned; queer; odd; as, a rum idea; a rum fellow.
v. i.
To make an addition. To add to, to augment; to increase; as, it adds to our anxiety.
superl.
Long practiced; hence, skilled; experienced; cunning; as, an old offender; old in vice.
superl.
Long cultivated; as, an old farm; old land, as opposed to new land, that is, to land lately cleared.
a.
Formed according to old or obsolete fashion or pattern; adhering to old customs or ideas; as, an old-fashioned dress, girl.
a.
Odd; strange; ugly; old; uncouth.
superl.
Not new or fresh; not recently made or produced; having existed for a long time; as, old wine; an old friendship.
a.
Quarrel; dispute; debate; strife; -- chiefly in the phrase at odds.